1. ► Topological sort requires O(V) space

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

3. ► Quick sort can be done in-place

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

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

6. ► A ready list can be obtained through topological sort prior to scheduling

7. ► Binary search only operates on sorted sequence

8. ► Topological ordering in a graph is unique

9. ► Searching is more expensive in sorted sequence

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

11. ► Topological sort is available in STL

12. ► Merge sort is not a stable sort

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

14. ► Heap sort cannot be done in-place

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

16. ► Binary is not a divide and conquer algorithm

17. ► Merge sort can be parallelized

18. ► Heap sort can be parallelized

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

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