1. ► Binary search only operates on sorted sequence

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

3. ► Merge sort can be parallelized

4. ► Heap sort cannot be done in-place

5. ► Binary is not a divide and conquer algorithm

6. ► Stable sorting always preserves the order

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

8. ► Heap sort can be parallelized

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

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

11. ► Binary search performs in linear time

12. ► Binary search on AVL trees can be done at most in O(lgn) steps

13. ► Heap sort guarantees O(nlgn) performance

14. ► Topological sort requires O(V) space

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

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

17. ► Quick sort can be done in-place

18. ► Heap sort makes use of heap data structure

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

20. ► Topological ordering in a graph is unique