V.
R
EFERENCES
[1]
Elisseeff, Andre, Theodoros Evgeniou, and Massimiliano Pontil. "Stability of randomized learning algorithms." Journal
of Machine Learning Research. 2005.
[2]
Estivill-Castro, Vladmir, and Derick Wood. “A survey of adaptive sorting algorithms."
ACM Computing Surveys
(CSUR) 24.4, 1992: 441-476.
[3]
Cormen, Thomas H., Leiserson, C. E., Rivest, R. L., & Stein, C. Introduction to algorithms. MIT press, 2009.
[4]
T. H. Cormen, C. E. Lieserson, R. L. Rivest and S.
Clifford, "Introduction to Algorithms", 3rd ed.,
the MIT Press
Cambridge, Massachusetts London, England 2009.
[5]
Debosiewicz W. An Efficient Variation of Bubble Sort. Information Processing Letters. 1980, 11(1): 5-6.
[6]
Iraj H., Afsari M. H. S., Hassanzadeh S. A New External Sorting Algorithm with Selecting the Record List Location.
USEAS Transactions on Communications. 2006, 5(5):909-913.
[7]
Kumari A., Chakraborty S. Software Complexity: A Statistical Case Study through Insertion Sort. Applied Mathematics
and Computation. 2007, 190(1): 40-50.
[8]
http://en.wikipedia.org/wiki/Merge_sort
[9]
Kronrod, M. A. (1969). "Optimal ordering algorithm without operational field", Soviet Mathematics - Doklady (10),
pp.744.
[10]
https://images.app.goo.gl/t9vU5mqdwsb9UuDJ6
[11]
https://images.app.goo.gl/w9iMuC5u5FtarsJV6
[12]
https://images.app.goo.gl/rwycUTeSUwyHye9k7
[13]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, "The Design and Analysis of Computer Algorithms", 1976, pp.66
[14]
https://images.app.goo.gl/VesQXHy5hADJptCV7
View
publication stats