Question

Consider the following three sorting algorithms: MergeSort (as studied), TreeSort (as described in Q14, and HeapSort described here: (1) iterate over a vector of values and insert next values one by one into a min-heap; then (2) repeat taking the top of the heap and re- inserting it into the next vector position (starting at index 0 and counting up), followed by popping the heap; once the heap is empty, the vector is sorted in ascending order. Complete each with a brief phrase or sentence completion (2 pts): (a) TreeSort and HeapSort are similar in that (b) HeapSort and MergeSort are similar to each other and differ from TreeSort in that

Answer 1

A)They both uses tree data structure to sort the data value.TreeSort creates a Binary Search tree from the value given and performs an inorder traversal to generate value in sorted format , Whereas Heap Sort creates a heap data structure(minheap or maxheap ,basically it is a binary tree with some other properties) and uses it for sorting the data.

B)HeapSort and MergeSort both have the worst case time complexity as O(n log n) whereas TreeSort has Worst Case Time Complexity as O( n²  ) .