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

2. ► Heap sort cannot be done in-place

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

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

5. ► Binary search performs in linear time

6. ► Hidden constants are higher in merge sort

7. ► Binary search is there in algorithm package

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

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

10. ► Topological sort is available in STL

11. ► Heap sort makes use of heap data structure

12. ► Topological ordering in a graph is unique

13. ► Quick sort can be done in-place

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

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

16. ► Merge sort can be parallelized

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

18. ► Merge sort has linear space requirement

19. ► Heap sort can be parallelized

20. ► Binary search only operates on sorted sequence