collaborators

1 paper

cs.DS2011

K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!

Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty +1

Sundararajan and Chakraborty (2007) introduced a new version of Quick sort removing the interchanges. Khreisat (2007) found this algorithm to be competing well with some other vers…