Contrastive analysis of bubble merge sort proposing hybrid approach
A sorting algorithm is one that puts elements of a list in a certain order. It makes easy searching and locating the information. The most used orders are numerical order and lexicographical order. An efficient sorting algorithm is that takes less time and space complexity. In this paper I make contrastive analysis of bubble sort and merge sort and tried to show why required some new approach to get best sorting results. In this regard we proposed a hybrid approach that will take minimum number of comparisons, with less time and space complexity to sort. Divide and conquer (merge sort) with bi directional bubble sort approach is used and an example data is sorted with such hybrid approach.
2016 Sixth International Conference on Innovative Computing Technology (INTECH)