1. ► Binary search performs in linear time

2. ► Stable sorting always preserves the order

3. ► Merge sort can be parallelized

4. ► Heap sort cannot be done in-place

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

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

7. ► Merge sort has linear space requirement

8. ► Merge sort is not a stable sort

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

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

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

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

13. ► Topological ordering in a graph is unique

14. ► Searching is more expensive in sorted sequence

15. ► Topological sort requires O(V) space

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

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

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

19. ► Quick sort can be done in-place

20. ► Topological sort is available in STL