Download PDFOpen PDF in browser

Sorting Algorithms

EasyChair Preprint no. 8030

9 pagesDate: May 22, 2022


In this paper, we will discuss important properties of different sorting techniques including their complexity, stability and memory constraints
and then compare their efficiency. Each sorting technique has an advantage in a certain situations, but is innefficient in another. Using raw data, we have experimented with the Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quicksort, Heap Sort, Counting Sort and Radix Sort. Although the results are different depending on the size and type of the data, the overall conclusion is that Radix Sort is in the majority cases, the most efficient algorithms.

Keyphrases: algorithm, efficiency, sorting

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Casian Jors},
  title = {Sorting Algorithms},
  howpublished = {EasyChair Preprint no. 8030},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser