1. ► Merge sort is not a stable sort

2. ► Heap sort can be parallelized

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

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

5. ► Binary search only operates on sorted sequence

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

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

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

9. ► Binary is not a divide and conquer algorithm

10. ► Quick sort can be done in-place

11. ► Heap sort guarantees O(nlgn) performance

12. ► Binary search performs in linear time

13. ► Stable sorting always preserves the order

14. ► Topological sort is available in STL

15. ► Topological sort requires O(V) space

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

17. ► Heap sort makes use of heap data structure

18. ► Heap sort cannot be done in-place

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

20. ► Binary search on AVL trees can be done at most in O(lgn) steps