%0 Journal Article %1 kirankumarsundararajanmitapal2013ksort %A Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty %A Mahanti, N.C. %D 2013 %E Hope, Dr.Martin %J Int. J. on Recent Trends in Engineering and Technology, %K Internal distribution sorting uniform %N 1 %P 4 %T K-Sort: A New Sorting Algorithm that Beats Heap Sort for n 70 Lakhs! %U http://searchdl.org/public/journals/2013/IJRTET/8/1/532.pdf %V 8 %X Sundararajan and Chakraborty 10 introduced a new version of Quick sort removing the interchanges. Khreisat 6 found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of the algorithm, which we call K-sort, is found to sort elements faster than Heap sort for an appreciably large array size (n  70,00,000) for uniform U0, 1 inputs.

@article{kirankumarsundararajanmitapal2013ksort, abstract = {Sundararajan and Chakraborty [10] introduced a new version of Quick sort removing the interchanges. Khreisat [6] found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of the algorithm, which we call K-sort, is found to sort elements faster than Heap sort for an appreciably large array size (n  70,00,000) for uniform U[0, 1] inputs.}, added-at = {2014-02-03T07:39:22.000+0100}, author = {{Kiran Kumar Sundararajan, Mita Pal}, Soubhik Chakraborty and Mahanti, N.C.}, biburl = {https://www.bibsonomy.org/bibtex/2b72168dd03f982b2ec7a19ee19fcfe87/idescitation}, editor = {Hope, Dr.Martin}, interhash = {5f20437b25afd8e2924ac3505cede493}, intrahash = {b72168dd03f982b2ec7a19ee19fcfe87}, journal = {Int. J. on Recent Trends in Engineering and Technology,}, keywords = {Internal distribution sorting uniform}, month = {January}, number = 1, pages = 4, timestamp = {2014-02-03T07:39:22.000+0100}, title = {K-Sort: A New Sorting Algorithm that Beats Heap Sort for n 70 Lakhs!}, url = {http://searchdl.org/public/journals/2013/IJRTET/8/1/532.pdf}, volume = 8, year = 2013 }