Qureshi Sort: A new Sorting Algorithm
Muhammad Anjum Qureshi · 2009
This paper discusses a new sorting algorithm. This algorithm has best & average cases between O (3N) & O (4N) and for worst case it may be O (N2) or more swear both in speed and memory, but it has a great property to tell its worst case in the starting iteration loop so that it can be switched to other Sorting Algorithms in worst cases. Qureshi Sort can combine with bubble sort to enhance the best case of bubble sort from O (N2) to O (N), and to use Bubble Sort in worst cases of Qureshi Sort. Qureshi Sort uses the difference of each element from the largest value to sort the list, also remembering the repetition of that element.