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

2. ► Merge sort has linear space requirement

3. ► Merge sort can be parallelized

4. ► Topological sort requires O(V) space

5. ► Heap sort can be parallelized

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

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

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

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

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

11. ► Heap sort guarantees O(nlgn) performance

12. ► Topological sort is available in STL

13. ► Binary search performs in linear time

14. ► Searching is more expensive in sorted sequence

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

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

17. ► Topological ordering in a graph is unique

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

19. ► Binary search is there in algorithm package

20. ► Binary is not a divide and conquer algorithm