Article thumbnail

The Folklore of Sorting Algorithms

By Santosh Khamitka, Parag Bhalchandra, Sakharam Lokhande and Nilesh Deshmukh

Abstract

The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine sorting algorithms in the folklore lines and try to discover the tradeoffs between folklore and theorems. Finally, the folklore knowledge on complexity values of the sorting algorithms will be considered, verified and subsequently converged in to theorems

Topics: Complexity Theory
Publisher: International Journal of Computer Science Issues, IJCSI
Year: 2009
OAI identifier: oai:cogprints.org:6714

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles

Citations

  1. (1978). A synthesis of several sorting algorithms, Acta Inf.
  2. Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) “, appeared in
  3. (1971). Analysis of sorting algorithms”,
  4. Fundamentals of Computer Algorithms,
  5. Inefficient sort algorithms – “A Computer Environment for Beginners' Learning of Sorting Algorithms: Design and Pilot Evaluation”,
  6. (2009). Proliferation of Analysis of Algorithms with application to Sorting Algorithms”, M.Phil Dissertation,
  7. (1980). Remarks on “A Synthesis of Several Sorting Algorithms”,
  8. (1995). Sorting In
  9. (1997). Talk presented by Dr. Sedgewick ,” Open problems in the analysis of sorting and searching algorithms”, at the Workshop on the probabilistic analysis of algorithms,
  10. The Art of Computer Programming, 3rd volume, "Sorting and Searching”,
  11. (2000). the Fastest Sorting Algorithm?” Doctor Dobbs Journal,