## Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study

Citations: | 1 - 0 self |

### BibTeX

@MISC{Jadoon_optimizedselection,

author = {Sultanullah Jadoon and Salman Faiz Solehria and Mubashir Qayum},

title = {Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study},

year = {}

}

### OpenURL

### Abstract

ABSTRACT – Optimized Selection Sort Algorithm is a new sorting algorithm that has been developed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of Optimized Selection Sort against Selection Sort and Insertion Sort Algorithms. The results proved that Optimized Selection Sort is much more efficient than Selection Sort Algorithm; Furthermore analysis supports the fact that Optimized Selection Sort is better than Insertion Sort

### Citations

148 |
Algorithm 232: Heapsort
- Williams
- 1964
(Show Context)
Citation Context ...est, easiest and most useful sorting algorithms for dealing with modicum of data set. If the first few objects are already sorted, an unsorted object can be inserted in the sorted set in proper place =-=[10]-=-. B.� Pseudo Code & Execution Time of Individual Statement of Insertion Sort Algorithm InsertionSort (X, n) � � � X[0..n-1] S.No Iteration Cost Times �� FOR�������TO��������X�� ��� �� �� ��DO���������... |

62 |
Algorithm 64: Quicksort
- Hoare
- 1961
(Show Context)
Citation Context ...ore alteration to work with new classes and data types and in large cases, do not perform as well as expected due to poorer locality of reference caused by linear passes through the array [1] [2] [3] =-=[4]-=-. It is necessary for a new algorithm to be acknowledged and used in the field of Computer Science, the process must be shown to have as good as performance to the abovementioned sorting algorithms an... |

30 | A new efficient radix sort - Andersson, Nilsson - 1994 |

15 | Leiserson and Stein, Introduction to Algorithms - Cormen - 2001 |

9 | An In-Place Sorting with O (n log n) Comparisons and O (n) Moves - Franceschini, Geffert - 2003 |

9 |
D.,”The Art of Computer Programming Sorting and Searching
- Knuth
- 1998
(Show Context)
Citation Context ...re more alteration to work with new classes and data types and in large cases, do not perform as well as expected due to poorer locality of reference caused by linear passes through the array [1] [2] =-=[3]-=- [4]. It is necessary for a new algorithm to be acknowledged and used in the field of Computer Science, the process must be shown to have as good as performance to the abovementioned sorting algorithm... |

9 |
CC-Radix: A Cache Conscious Sorting Based on Radix Sort
- Jiménez-González, Navarro, et al.
- 2003
(Show Context)
Citation Context ... efficient way to accomplish a task is usually preferred, and the comparison-based sorts tinted here offer excellent performance and adaptability to any type of record or data type to be sorted [5][6]=-=[7]-=-. Insertion Sort and Selection Sort have been around for over half a century, and have been taught widely in the academic Computer Science community. These algorithms are established and well document... |

6 | D.Wood."A Survey of Adaptive Sorting Algorithms", Computing Surveys - Estivill-Castro - 1992 |

5 |
I."Analysis of Internal Computer Sorting
- Flores
- 1961
(Show Context)
Citation Context ...ly require more alteration to work with new classes and data types and in large cases, do not perform as well as expected due to poorer locality of reference caused by linear passes through the array =-=[1]-=- [2] [3] [4]. It is necessary for a new algorithm to be acknowledged and used in the field of Computer Science, the process must be shown to have as good as performance to the abovementioned sorting a... |

4 |
A Research thesis, On Why Parameters of Input Distributions Need be Taken Into Account For a More Precise Evaluation of Complexity for Certain Algorithms
- Chakraborty, Bose, et al.
(Show Context)
Citation Context ...t time efficient way to accomplish a task is usually preferred, and the comparison-based sorts tinted here offer excellent performance and adaptability to any type of record or data type to be sorted =-=[5]-=-[6][7]. Insertion Sort and Selection Sort have been around for over half a century, and have been taught widely in the academic Computer Science community. These algorithms are established and well do... |

3 | A Fast Radix Sort". The computer journal 35 - DAVIS - 1992 |

2 | Design and Analysis of Optimized Selection Sort Algorithm
- Jadoon, Solehria, et al.
(Show Context)
Citation Context ...ect. However, this paper does reveal new information on a newly developed comparison-based sorting algorithm based on the Selection Sort Algorithm, known as Optimized Selection Sort Algorithm [8] [9] =-=[15]-=-. OSSA also referred to as Optimized Selection Sort Algorithm, is a new in place comparison-based sort. Logic of OSSA based on the old selection sort algorithm. The main difference in old SS and new O... |

1 |
Fast Algorithms for Sorting and
- Bentley, Sedgewick
(Show Context)
Citation Context ...this aspect. However, this paper does reveal new information on a newly developed comparison-based sorting algorithm based on the Selection Sort Algorithm, known as Optimized Selection Sort Algorithm =-=[8]-=- [9] [15]. OSSA also referred to as Optimized Selection Sort Algorithm, is a new in place comparison-based sort. Logic of OSSA based on the old selection sort algorithm. The main difference in old SS ... |