1. ► Heap sort can be parallelized
2. ► Stable sorting always preserves the order
3. ► STL doesn’t have an implementation of quick sort
4. ► For faster and frequent searches, sorted sequences are better to work on
5. ► Sorting algorithm with logarithmic component in complexity works faster
6. ► Merge sort can be parallelized
7. ► Binary search on AVL trees can be done at most in O(lgn) steps
8. ► Topological sort is available in STL
9. ► Binary search is there in algorithm package
10. ► Searching is more expensive in sorted sequence
11. ► Binary is not a divide and conquer algorithm
12. ► Merge sort has linear space requirement
13. ► Binary search performs in linear time
14. ► Heap sort doesn’t have an implementation in STL
15. ► Merge sort works on the principle of divide-and-conquer
16. ► Heap sort makes use of heap data structure
17. ► Quick sort is one of the most extensively used sorting algorithm
18. ► Hidden constants are higher in merge sort
19. ► Heap sort cannot be done in-place
20. ► Quick sort works on the principle of divide and conquer