1. ► Topological ordering in a graph is unique

2. ► Binary search performs in linear time

3. ► Topological sort requires O(V) space

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

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

6. ► Heap sort cannot be done in-place

7. ► Merge sort has linear space requirement

8. ► Heap sort makes use of heap data structure

9. ► Heap sort guarantees O(nlgn) performance

10. ► Stable sorting always preserves the order

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

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

13. ► Hidden constants are higher in merge sort

14. ► Topological sort is available in STL

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

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

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

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

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

20. ► Binary search is there in algorithm package