Vandana Sharma and Parvinder S. Sandhu and Satwinder Singh and Baljit Saini Analysis of Modified Heap Sort Algorithm on Different Environment
1143 - 1145
2008
2
6
International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering http://waset.org/publications/14236
http://waset.org/publications/18
World Academy of Science, Engineering and Technology
In field of Computer Science and Mathematics,
sorting algorithm is an algorithm that puts elements of a list in a
certain order i.e. ascending or descending. Sorting is perhaps the
most widely studied problem in computer science and is frequently
used as a benchmark of a systems performance. This paper
presented the comparative performance study of four sorting
algorithms on different platform. For each machine, it is found that
the algorithm depends upon the number of elements to be sorted. In
addition, as expected, results show that the relative performance of
the algorithms differed on the various machines. So, algorithm
performance is dependent on data size and there exists impact of
hardware also.
International Science Index 18, 2008