2 papers
cs.DS2012
How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?
Mita Pal, Soubhik Chakraborty, N. C. Mahanti
The present paper examines the behavior of Shift-insertion sort (insertion sort with shifting) for normal distribution inputs and is in continuation of our earlier work on this new…
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…