Browsing Data Science Institute (Conference Papers) by Subject "Non-partitioning merge sort"
Now showing items 1-1 of 1
Non-partitioning merge-sort: Performance enhancement by elimination of division in divide-and-conquer algorithm (ACM, 2016-03-04)The importance of a high performance sorting algorithm with low time complexity cannot be over stated. Several benchmark algorithms viz. Bubble Sort, Insertion Sort, Quick Sort, and Merge Sort, etc. have tried to achieve ...