1. ► Heap sort guarantees O(nlgn) performance

2. ► Topological ordering in a graph is unique

3. ► Binary search is there in algorithm package

4. ► Heap sort can be parallelized

5. ► Merge sort can be parallelized

6. ► Stable sorting always preserves the order

7. ► Merge sort has linear space requirement

8. ► Quick sort is one of the most extensively used sorting algorithm

9. ► For faster and frequent searches, sorted sequences are better to work on

10. ► Merge sort is not a stable sort

11. ► Binary search only operates on sorted sequence

12. ► Heap sort cannot be done in-place

13. ► Hidden constants are higher in merge sort

14. ► Merge sort works on the principle of divide-and-conquer

15. ► Merge sort’s O(nlgn) performance is not guaranteed

16. ► A simple depth-first walk is enough to give topological ordering

17. ► Binary search performs in linear time

18. ► Heap sort makes use of heap data structure

19. ► Searching is more expensive in sorted sequence

20. ► In unsorted sequence, key and data cannot stay together