Essay On Sorting

3. A NOVEL (D-SHUFFLE) SORTING TECHNIQUE USING DIVIDE AND CONQUER TECHNIQUE

3.1 Introduction

Sorting has been analyzed by computer scientists for decades, and thus it is an ideal subject to begin with when studying computer science. Sorting is done with algorithms, which are a set of specific commands that are followed in a certain order to complete a task. To study sorting, must first be comfortable with iteration and recursion. These two terms designate the ways tasks are repeatedly performed. The problem of sorting can have two meanings. In one context, it refers to grouping similar items; for example, sorting laundry into piles of shirts and socks. In another context, it refers to ordering items according to some rules; for example, organizing names alphabetically in a phone book. The formal study of sorting is reserved for a course in data structures or algorithms, where numerous variations on sorting are studied.

There are several elementary and advanced sorting algorithms. Some sorting algorithms are simple and spontaneous, such as the bubble sort. Others, such as the quick sort are enormously complex, but produce super fast results. Some sorting algorithm work on less number of elements, some are suitable for floating point numbers, some are good for specific range, some sorting algorithms are used for huge number of data, and some are used if the list has repeated values. Other factors to be considered in choosing a sorting algorithm include the programming effort, the number of words of main memory available, the size of disk or tape units and the extent to which the list is already ordered [4]. That means all sorting Algorithms are problem specific, meaning they work well on some specific problem and do not work well...

... middle of paper ...

...ults are obtained by taking average of 5 experiments. The proposed method is performing 96 % efficiency than Bubble sort and some random data set equivalence with Quick sort. The proposed algorithm D-Shuffle sort compares with some standard survey papers based on Divide & Conquer sorting methodology and its execution time results based on the various data size are given in the table 1. Based on the results in the table 1, for some larger data sets, the proposed algorithm works much faster than the GCS method.

Author Name Year Sorting name Method 50 500 1000 5000 10000

Rajat K. Pal 2004 Sieve Sort Divide & Conquer 1 1 2 2 14.2

KhalidSuleiman Al-Kharabsheh 2013 Grouping Comparison Sort(GCS) Divide & Conquer 3 4 4 19 983

S.Muthusundari Dr. R.M.Suresh 2013 D-Shuffle Sort Divide & Conquer 6 8 8 13 58.9

Table 1. Comparative study of execution time in milliseconds (ms)