Book

Description

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, “Sort1 Algorithm”, “Sort2 Algorithm”, “Sort3 Algorithm”, “Sort4 Algorithm”, “Sort5 Algorithm”, “Sort6 Algorithm”,“Sort7 Algorithm”, “Sort8 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, “Sort1 Algorithm” which is compared with bubble sort, selection sort, and insertion sort algorithms. Here input is divided into two parts. On the second half numbers, arrange the second half numbers by last number to first number in 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, “Sort2 Algorithm” which is compared with bubble sort, selection sort, and insertion sort algorithms. Here input is divided into two parts. One part has odd position numbers and other part number has even position numbers. The odd position numbers are arranged by simple comparisons. Then combine even position numbers. Likewise Sort3 Algorithm to Sort8 Algorithm are described in this book.