Download PDFOpen PDF in browser

An Efficient Optimized Sorting Technique Using Combination of Other Techniques

EasyChair Preprint no. 4826

3 pagesDate: December 29, 2020


The problem of sorting is a problem that arises frequently in computer programming and though which is need to be resolved. Many different sorting algorithms have been developed and improved to make sorting optimized and fast. As a measure of performance mainly the average number of operations or the average execution times of these algorithms have been compared. There is no one sorting method that is best for every situation. Some of the factors to be considered in choosing a sorting algorithm include the size of the list to be sorted, the programming effort, the number of words of main memory available,the size of disk or tape units, the extent to which the list is already ordered, and the distribution of values.

Keyphrases: complexity lists, movement sorting algorithms, sorting

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Nitin Mishra and Pranjal Srivastava and Khushi Gupta and Kunal Singh Teotia},
  title = {An Efficient Optimized Sorting Technique Using Combination of Other Techniques},
  howpublished = {EasyChair Preprint no. 4826},

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