Abstract: Sorting is a basic technique which is used in data structure. Most efficiency issue is occur when to sort the large amount of data. There are many algorithm and techniques are available to sort efficiently such type of data. For example, quicksort is very well performed in most practical situation, moreover the other sorting algorithm have better in worst case behavior. Lastly I present the comparison of different sorting algorithm with efficiency and the knowledge which I gained from the study.
Keywords: Adjacent, Divide and conquer, Sort, Swap, efficiently
| DOI: 10.17148/IJARCCE.2019.8708