2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2012
Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm
Niraj Kumar Singh, Soubhik Chakraborty
Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in…
cs.DS2012
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…
cs.DS2012★ 2 cited
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…