Paper Title :Comparison Based Identification Of Sorting Algorithm For A Problem

Author :Satwinder Kaur, Harpal Singh & Prabhdeep Singh

Article Citation :Satwinder Kaur ,Harpal Singh & Prabhdeep Singh , (2013 ) " Comparison Based Identification Of Sorting Algorithm For A Problem " , International Journal of Advance Computational Engineering and Networking (IJACEN) , pp. 67-75, Volume-1,Issue-1

Abstract : 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.

Type : Research paper

Published : Volume-1,Issue-1

	|		PDF	|	Viewed - 27	|	Published on 2014-01-17