Work

A Comparative Study of Various Sorting Algorithms

Year: 2018

Type: preprint

Abstract: This paper is aimed at comparing the time complexity of six sorting algorithms: bubble sort, insertion sort, selection sort, counting sort, radix sort and bucket sort. Based on the logic implemented to sort the set of values, algorithms are categorized into comparison and noncomparison sorting algorithms. The choice of sorting algorithm to be implemented depends on the range and distribution of values to be sorted. The scenario in which each of the algorithms generates good performance and is preferred to be implemented is discussed and the control flow structure of each of the sorting algorithms is illustrated.

Source: SSRN Electronic Journal

Authors: Sandeep K. Gill, Virendra Singh, Pankaj Sharma, Durgesh Kumar

Institutions: G.L. Bajaj Institute of Technology and Management Greater Noida, ICFAI University, Dehradun

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3135811042

Cites:

Cited by: 28

Related to: 10