1. ► Stable sorting always preserves the order

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

3. ► Binary search only operates on sorted sequence

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

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

6. ► Merge sort can be parallelized

7. ► Binary is not a divide and conquer algorithm

8. ► Topological sort is available in STL

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

10. ► Heap sort guarantees O(nlgn) performance

11. ► Binary search is there in algorithm package

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

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

14. ► Heap sort makes use of heap data structure

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

16. ► Topological sort requires O(V) space

17. ► Heap sort can be parallelized

18. ► Heap sort cannot be done in-place

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

20. ► Searching is more expensive in sorted sequence