%0 Journal Article
	%A Vandana Sharma and  Parvinder S. Sandhu and  Satwinder Singh and  Baljit Saini
	%D 2008
	%J International Journal of Electrical and Computer Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 18, 2008
	%T Analysis of Modified Heap Sort Algorithm on Different Environment
	%U https://publications.waset.org/pdf/14236
	%V 18
	%X 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 system-s 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.
	%P 1143 - 1145