Comparative Performance Evaluation of Heap-Sort and Quick-Sort Algorithms

Provided by: Middle East Association of Computer Science and Engineering (MEACSE)
Topic: Software
Format: PDF
Sorting is a fundamental operation in computer science (many programs use it as an intermediate step). A large number of sorting algorithms have been made in order to have a best performance in terms of computational complexity (best, average and worst), memory usage, stability and method. One of sorting algorithms can perform much better than another. For that, the authors intend to make a comparison paper and two representative algorithms were chosen to show these differences. In the paper, a comparative performance evaluation of two sorting algorithms heap-sort and quick-sort will be presented depending on the performance factors shown above.

Find By Topic