Study of Sorting Algorithm to Optimize Search Results
Surmeet Kaur · 2013
Sorting involves rearranging information into either ascending or descending order. There are many sorting algorithms; Sorting has been an area of interest for all those who have been involved into the mining field of data. Sorting data is important to search the data appropriately. For different types of works different types of sorting algorithm has been proposed by different scientist. There are several issues with sorting to taken into account but In this paper, we will compare the bubble sort with binary sort then merge them to take the better performance of be focusing on the time factor of the sorting. This research is about comparing and merging such an algorithm which fits into each and every account of sorting and searches the data appropriately. For the same we will have to look into the previous done algorithms also and then we would have to compare the previous work with our latest done work.