Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation
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, Sourabh, Sundararajan and Chakraborty (2007) demonstrated that this algorithm sorts inputs from certain probability dist...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Mirton Publishing House, Timisoara
2009-12-01
|
| Series: | Anale: Seria Informatică |
| Subjects: | |
| Online Access: | http://anale-informatica.tibiscus.ro/download/lucrari/7-2-01-Kumar.pdf |