What are the applications of merge sort?

Applications of heap sort

• One of the biggest application of heap sort is constructing a priority queue basic idea is that, we want to know the tasks that carry the highest priority, given a large number of things to do. and this is exactly how heap sort works.
  
• Another application is interval scheduling. we may have a list of tasks with certain start and finish times and we want to do as many of these tasks as possible in a given period of time. in order to sort the finish time efficient algorithm to use is heap sort .
• In essence application or algorithm that involves sorting a list of elements will rely heavily on an efficient sorting algorithm and heap sort can provide such a function.