1. ► Topological sort requires O(V) space

2. ► Topological sort is available in STL

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

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

5. ► Binary search is there in algorithm package

6. ► Heap sort makes use of heap data structure

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

8. ► Merge sort is not a stable sort

9. ► Topological ordering in a graph is unique

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

11. ► Heap sort can be parallelized

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

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

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

15. ► Heap sort cannot be done in-place

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

17. ► Stable sorting always preserves the order

18. ► Searching is more expensive in sorted sequence

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

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