Study and improvement over insertion sort along with comparative analysis
Loading...
Date
2015-07
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand)
Abstract
Sorting is most widely used activity in the computer world without which computer cannot complete a single task efficiently. Sorting is used in many applications like searching, real-time systems and operating systems. Although there is a large number of sorting algorithms available but there is no single sorting algorithm that fulfills all the requirements. In this work I proposed a sorting technique; a type of hybrid sort method is based on the idea similar to insertion sort and efficiently sorts the elements of a given list. This sorting approach uses an additional step and binary search is used to find the exact location at which element is to be inserted in the list. A comprehensive empirical analysis has been done on the proposed approach and it has been compared with the traditional sorting methods- bubble, insertion, and selection sort. The results showed that proposed sorting approach is fast and effective than the sorting algorithms belong to O(N2) complexity class like insertion sort, selection sort and bubble sort in most of the cases as it required very less number of comparisons and takes less time and swaps to sort the elements of a list.
Description
Keywords
null