Abstract
In everyday life there is a large amount of data to arrange because sorting removes any ambiguities and make the data analysis and data processing very easy, efficient and provides with cost less effort. In this study a set of improved sorting algorithms are proposed which gives better performance and design idea. In this study five new sorting algorithms (Bi-directional Selection Sort, Bi-directional bubble sort, MIDBiDirectional Selection Sort, MIDBidirectional bubble sort and linear insertion sort are presented. Bi-directional Selection Sort and MIDBiDirectional Selection Sort are the enhancement on basic selection sort while Bidirectional bubble sort and MIDBidirectional bubble sort are the enhancement on basic bubble sort by changing the selection and swapping mechanism of data for sorting. Enhanced sorting algorithms reduced the iteration by half and quarter times respectively. Asymptotically complexities of these algorithms are reduced to O (n 2 /2) and O (n 2 /4) from O (n 2 ). Linear insertion sort is the enhancement of insertion sort by changing the design of algorithm (convert two loops to one loop). So asymptotically this algorithm is converted to linear time complexity from quadratic complexity. These sorting algorithms are described using C. The proposed algorithms are analyzed using asymptotic analysis and also using machine-running time and compared with their basic sorting algorithms. In this study we also discuss how the performance and complexity can be improved by optimizing the code and design.
Highlights
In algorithmic engineering Sorting is very profound area for researchers and algorithmic engineers
Basic bubble sort has the order of growth O (n2) but the presented two enhancements of bubble sort have the order of growth as O (n2/2) and O (n2/4) which can be shown using chart as below
In this study five new sorting algorithms are presented by enhanced the selection, bubble and insertion sort algorithms
Summary
In algorithmic engineering Sorting is very profound area for researchers and algorithmic engineers. Results of sorting algorithm are abundant and are not absolute because these are specific to some factors. Bubble and insertion are characterizes as comparison sort because these algorithms sort the data by comparing the data element with each other and selects the element location and swap on that location. These all costs O (n2) in worst case scenario which is the basic limitation of comparison sort techniques. Another limitation of these algorithms is that these has n2 times iteration in worst case but it can be reduced by optimizing these algorithms and in this study the approach followed is same.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
