3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2013★ 3 cited
List Sort: A New Approach for Sorting List to Reduce Execution Time
Adarsh Kumar Verma, Prashant Kumar
In this paper we are proposing a new sorting algorithm, List Sort algorithm, is based on the dynamic memory allocation. In this research study we have also shown the comparison of…
stat.CO2012★ 1 cited
Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation
Prashant Kumar, Anchala Kumari, Soubhik Chakraborty
Sundararajan and Chakraborty (2007) introduced a new sorting algorithm by modifying the fast and popular Quick sort and removing the interchanges. In a subsequent empirical study,…