%0 Generic %1 Jadoon_designand %A Jadoon, Sultanullah %A Solehria, Salman Faiz %A Dr, Prof %A Rehman, Salim %A Jan, Prof Hamid %D ? %K 2012 analysis kde optimized selection seminar sort %T Design and Analysis of Optimized Selection Sort Algorithm %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.3100 %X 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.

@misc{Jadoon_designand, 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.}, added-at = {2012-06-15T16:54:03.000+0200}, author = {Jadoon, Sultanullah and Solehria, Salman Faiz and Dr, Prof and Rehman, Salim and Jan, Prof Hamid}, biburl = {https://www.bibsonomy.org/bibtex/25654ab97150e78cd7c500b9e77636b21/lenz}, description = {CiteSeerX — Design and Analysis of Optimized Selection Sort Algorithm}, interhash = {672e2d25ecff0fab72da55806905286a}, intrahash = {5654ab97150e78cd7c500b9e77636b21}, keywords = {2012 analysis kde optimized selection seminar sort}, timestamp = {2012-06-15T16:54:04.000+0200}, title = {Design and Analysis of Optimized Selection Sort Algorithm}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.3100}, year = {?} }