## Design and Analysis of Optimized Selection Sort Algorithm

Citations: | 2 - 1 self |

### BibTeX

@MISC{Jadoon_designand,

author = {Sultanullah Jadoon and Salman Faiz Solehria and Prof Dr and Salim Rehman and Prof Hamid Jan},

title = {Design and Analysis of Optimized Selection Sort Algorithm},

year = {}

}

### OpenURL

### Abstract

Abstract — One of the most frequent operation performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Index Sequential Access Method (ISAM), but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and efficient. This research paper presents a new sorting algorithm named as “Optimized Selection Sort Algorithm, OSSA”.OSSA is designed to perform sorting quickly and more effectively as compared to the existing version of selection sort. The introduction of OSSA version of selection sort algorithm for sorting the data stored in database instead of existing selection sort algorithm will provide an opportunity to the users to save almost 50 % of their operation time with almost 100% accuracy.

### Citations

148 |
Algorithm 232: Heapsort
- Williams
- 1964
(Show Context)
Citation Context ...st, there has been a growing interest on enhancements to sorting algorithms that do not have an effect on their asymptotic complexity but rather tend to improve performance by enhancing data locality =-=[10]-=-[ 9] [11]. Sorting is an essential task that is performed by most computers. It is used commonly in a large variety of important applications. Database applications used by universities, banks, and ot... |

147 | Fast algorithms for sorting and searching strings
- Bentley, Sedgewick
- 1997
(Show Context)
Citation Context ...etter than another. Performance of various sorting algorithms depend upon the data being sorted. Sorting is used in many important applications and there have been a plenty of performance analyses [6]=-=[8]-=-. However, most earlier research is based on the algorithm’s theoretical complexity or their non-cached architecture. As almost all computers now a day’s contain cache, it is important to analyze them... |

62 |
Algorithm 64: Quicksort
- Hoare
- 1961
(Show Context)
Citation Context ...The common sorting algorithms can be divided into two classes by the difficulty of their algorithms. There is a direct correlation between the complexity of an algorithm and its relative effectiveness=-=[4]-=-. The complexity of algorithmic is generally written in a form known as Big – O (n) notation, where the O represents the complexity of the algorithm and a value n represents the size of the set the al... |

30 | A new efficient radix sort
- Andersson, Nilsson
- 1994
(Show Context)
Citation Context ... has been a growing interest on enhancements to sorting algorithms that do not have an effect on their asymptotic complexity but rather tend to improve performance by enhancing data locality [10][ 9] =-=[11]-=-. Sorting is an essential task that is performed by most computers. It is used commonly in a large variety of important applications. Database applications used by universities, banks, and other insti... |

16 |
Cli_ord Stein.Introduction to Algorithms
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ...eless. If an application only needs to sort smaller amount of data, then it is suitable to use one of the simple slow sorting algorithms as opposed to a faster, but more complicated sorting algorithm =-=[14]-=-. II. ANALYSIS OF OLD SELECTION SORT ALGORITHM A. Selection Sort This is a very easy sorting algorithm to understand and is very useful when dealing with small amounts of data. However, as with Bubble... |

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 ...as repeated values. We sort data either in statistical order or lexicographical, sorting numerical value either in increasing order or decreasing order and alphabetical value like addressee key [1][2]=-=[3]-=-. The common sorting algorithms can be divided into two classes by the difficulty of their algorithms. There is a direct correlation between the complexity of an algorithm and its relative effectivene... |

9 | CC-Radix: A Cache Conscious Sorting Based on Radix Sort - Jiménez-González, Navarro, et al. - 2003 |

6 |
D.Wood."A Survey of Adaptive Sorting Algorithms", Computing Surveys
- Estivill-Castro
- 1992
(Show Context)
Citation Context ...luence performance. A large number of sorting algorithms have been proposed and their asymptotic complexity, in terms of the number of comparisons or number of iterations, has been carefully analyzed =-=[13]-=-. C. Execution Flow Graph of Old Selection Sort In the recent past, there has been a growing interest on enhancements to sorting algorithms that do not have an effect on their asymptotic complexity bu... |

5 |
I."Analysis of Internal Computer Sorting
- Flores
- 1961
(Show Context)
Citation Context ...list has repeated values. We sort data either in statistical order or lexicographical, sorting numerical value either in increasing order or decreasing order and alphabetical value like addressee key =-=[1]-=-[2][3]. The common sorting algorithms can be divided into two classes by the difficulty of their algorithms. There is a direct correlation between the complexity of an algorithm and its relative effec... |

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 ...ithm is run against. The two groups of sorting algorithms are O( ... |

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