Root To Fruit (4): A Life Cycle Theory Of Sorting Algorithms

  • Pramod M. Kadam Assistant Professor, Bharati Vidyapeeth Deemed to be University, IMED, Pune
Keywords: Sorting algorithms, Applications of sorting algorithms, Sorting Life cycle, Efficacy of sorting algorithms

Abstract

Sorting functionality identified as one of the significant functionality which computer has to perform. sorting algorithms gives solutions to the sorting problems. The nature and implementation of sorting algorithms change problem to problem[1]. In result, plenty of the sorting algorithms adds in the computing domain every after technological cycle. Due to which domain makes rich in the count but all the sorting algorithms invented are not useful at the same time. Therefore it is required to study the sorting algorithms by the life cycle approach. The presented new dimension of study will help to decide the application value or usability of the particular sorting algorithms in the computing.

References

G. T.Heineman, “Sorting Algorithms,” Algorithms, in a Nutshell, O Reilly, 2007.
[2] A. Levintin, Introduction to Design and analysis of Algorithms, Second Edi. New Delhi: Pearson, 2013.
[3] R.G.Dromy, How to solve it by a computer, 8th ed. New Delhi: Pearson Education, 2009.
[4] D. E.Knuth, The art of Computer programming Vol.3 Sorting and Searching, 2nd ed., vol. 3, no. 3. New Delhi: Pearson Education, 2006.
[5] P. Kadam and S. Kadam, “Root to Fruit ( 2 ): An Evolutionary Approach for Sorting Algorithms,” Orient. J. Comput. Sci. Technol., vol. Vol. 7, no. 3, pp. 369–376, 2014.
[6] J. A. N. LEE, “Those Who Forget The Lessons of History, or Why I Study the History of Computing,” IEEEAnnals ojthe Hist. Comput., vol. 18, no. 2, p. 9, 1996.
[7] J. E. SAMMET, “Some Approaches to, andIllustrations of, ProgrammingLanguage History,” Ann. Hist Comput, vol. 13, no. 1, p. 18, 1991.
[8] B. J. Oates, Researching Information Systems and Computing, South asia. New Delhi: Sage Publication, 2007
Published
2019-05-27
Section
Articles