Quicker Sort Algorithm: Upgrading time complexity of Quick Sort to Linear Logarithmic

Abstract

Quick Sort is a famous algorithm. It was the fastest algorithm at one point in time. However, sometimes it can give polynomial time complexity. The only thing that is important in this algorithm is the selection of Pivot Element. In this paper, we proposed a new algorithm, which is based on Quick Sort, and through our testing, we conclude that this algorithm is giving good results for small as well as large data sets.