2 citations · 2 across the 4 of their papers we have counts for
4 papers
The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs
Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty
The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that th…
Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in…
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…
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…