Comparison Based Identification Of Sorting Algorithm For A Problem
Sorting is essential in today’ era of computing as for various operations and arises need for ordered data.
Organized data is easy to access and operate upon. There are various sorting algorithms and each has its own merits. For a
particular problem, is difficult to find an algorithm which has minimum time complexity (execution time) and minimum
space complexity (memory used). So, time-space tradeoff plays an important role to reduce the computational time at the
cost of increased memory use. A sorting algorithm cannot be used for every type of problem so depending upon the user
inputs and requirements, optimal algorithm from the multiple sorting algorithms can be chosen as these are problem specific.
This work analyzes the different sorting algorithms at the implementation level and provides a comparative study which will
help in choosing the optimal sorting algorithm for a specific problem.