Author of the publication

How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?

, , and . CoRR, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Software complexity: A statistical case study through insertion sort., and . Applied Mathematics and Computation, 190 (1): 40-50 (2007)Replacement sort revisited: The "gold standard" unearthed!, , , and . Applied Mathematics and Computation, 189 (1): 384-394 (2007)Winograd's algorithm statistically revisited: It pays to weigh than to count!, and . Applied Mathematics and Computation, 190 (1): 15-20 (2007)Which notes are Vadi-Samvadi in Raga Rageshree?, , , , and . CoRR, (2008)How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?, , and . CoRR, (2012)On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2, and . CoRR, (2008)Assessment of Level of Recovery of Cognitive Impairment in the Cerebrovascular Accident and Head Injuries Cases: Therapeutic Impact of North Indian Ragas., , and . CMMR/FRSM, volume 7172 of Lecture Notes in Computer Science, page 44-52. Springer, (2011)Optimized Neural Architecture for Time Series Prediction Using Raga Notes., , and . CMMR/FRSM, volume 7172 of Lecture Notes in Computer Science, page 26-33. Springer, (2011)K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!, , , and . CoRR, (2011)A new sorting algorithm., and . Applied Mathematics and Computation, 188 (1): 1037-1041 (2007)