In this study we have studied about various sorting algorithms and their comparison. There is advantage and disadvantage
in every sorting algorithm. To find the running time of each sorting algorithm I used one Program for comparing the running
time (in Microseconds). After running the same program on five different runs (for each different value of N=10, 100, 1000,
10000), I calculated the average running time for each algorithm and then showed the result with the help of a chart. From the
chart I can conclude that Quick Sort is the most efficient algorithm