A COMPARATIVE STUDY OF SORTING ALGORITHM BASED ON THEIR TIME COMPLEXITY

The interest is to develop the fastest sorting algorithm and also efficient in all respect , has become one of the challenges of this century, resulting in many algorithm available to the individual, which needs to sort the list of different data. Presently, we have large number of data, we require some sorting techniques that can sort these data as quick as possibl e and also gives great efficiency with respect to space as well as time. In this paper, we will discuss some of the sorting algorithms and compare their time complexities for the list of data