Fuse sort algorithm a proposal of divide & conquer based sorting approach with O(nloglogn) time and linear space complexity

Computational Complexity is a fundamental research area in the field of computer science. It has attracted lots of interest of various researchers. In past, vast number of sorting algorithms has been proposed by various researchers. To efficiently optimize any sorting problem having large number of elements requires O(nlogn) time in average case by existing sorting techniques. This paper presents a new sorting technique based on divide & conquer approach, named as Fuse sort algorithm, an approach of comparison based sorting with O(nloglogn) time and linear space. The priory and mathematical analysis of proposed sorting algorithm is given and a case study with merge sort is performed based on several factors.