1. ► Merge sort has linear space requirement

2. ► Hidden constants are higher in merge sort

3. ► Searching is more expensive in sorted sequence

4. ► Quick sort guarantees O(nlgn) performance in all the cases

5. ► Heap sort guarantees O(nlgn) performance

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

7. ► Heap sort makes use of heap data structure

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

9. ► Sorting algorithm with logarithmic component in complexity works faster

10. ► Topological ordering in a graph is unique

11. ► Stable sorting always preserves the order

12. ► Merge sort can be parallelized

13. ► STL doesn’t have an implementation of quick sort

14. ► Binary search only operates on sorted sequence

15. ► Heap sort cannot be done in-place

16. ► Topological sort is available in STL

17. ► Heap sort doesn’t have an implementation in STL

18. ► Binary search performs in linear time

19. ► Merge sort is not a stable sort

20. ► Quick sort works on the principle of divide and conquer