Advanced Optimization of Fundamental Searching and Sorting Algorithms

Abstract

Searching and Sorting are the most important data structure operations, which make easy searching, arranging and locating the information. One of the basic problems of computer science is sorting a list of items and searching elements in the array. There are a number of solutions to these problems, known as sorting algorithm, and searching algorithm. Some searching algorithms are simple and spontaneous, such as the Linear Search, Binary Search. All searching algorithms are problem specific meaning they work well on some specific problem and do not work well for all the problems, therefore, appropriate for specific kinds of problems. Some searching algorithm works on less number of elements. There are some fundamental sorting algorithms as Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Bubble Sort etc. After studying various sorting and searching algorithms we found that the algorithms can be optimised. This paper presents a new searching algorithms named as “OBSwQS” is designed to perform searching quickly and more effectively as compared to the existing version of searching algorithm in which there are used the concepts of Binary Search and Quick Sort algorithms, and the optimised sorting algorithms as “DNSS”, “DNBS”, “Insertion Sort within the Merge Sort” and etc. are the optimised sorting algorithm which are the optimization of Fundamental Selection Sort, Bubble Sort, Merge Sort and etc. The introduction of Dual Nature Selection Sort and Dual Nature Bubble Sort version of selection sort algorithm and Bubble Sort for sorting the data stored in database instead of existing selection sort algorithm and Bubble Sort algorithm will provide an opportunity to the users to save almost 50% of their operation time with almost 100% accuracy. In “Insertion Sort within the Merge Sort algorithm” there is found out the value of maximum value of n ( n is number of items to be sorted) so that the insertion sort beats the merge sort. Hence the “ISwMS” is optimization of Fundamental Merge Sort algorithm.