Set2 New Sorting Algorithms on Data Structures: Example Approach

Sorting is one of the important work in the computer data. Many data arranging algorithms are available. All algorithms are having separate techniques. This book is explained with best case, worst case and average cases. Some existing algorithms such as Bubble sort, Insertion sort and Selection Sort are compared with the proposed algorithms. In the computer field, quick sort, merge sort, heap sort, bubble sort, insertion sort, selection sort, cycle sort and Odd-Even sort are some examples of sorting algorithms. All algorithms are having separate properties. This book explains some new sorting algorithms and its results are discussed with some relevant examples. This book is described with some new practical approaches. The algorithms are, “Sort9 Algorithm”, “Sort10 Algorithm”, “Sort11 Algorithm”, “Sort12 Algorithm”, “Sort13 Algorithm”which are compared with bubble sort, selection sort, and insertion sort algorithms. On time complexity, the proposed algorithms are compared with the best sorting algorithms also. Some example data on new sorting algorithms are described here. This book explains about a new data arranging algorithm, “Sort9 Algorithm” which is compared with bubble sort, selection sort, and insertion sort algorithms.Here input is divided into three parts. First and Third parts are used as First portion numbers and Second part is used as Second portion numbers. The First portion numbers are arranged by simple comparison On first half numbers,arrange the first half numbers by left to right numbers in simple comparison.This book describes about a new data arranging algorithm, “Sort10 Algorithm” which is compared with bubble sort, selection sort, and insertion sort algorithms. Here input is divided into two parts. First half part has lesser, greater numbers and Second half part has remaining numbers. The lesser, greater numbers are arranged by simple comparison Likewise Sort11 Algorithm to Sort13 Algorithm are described in this book.