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

2. ► Harmonic series results in polynomial bounds

3. ► Implementation of Dijkstra’s algorithm can make use of heap

4. ► Binary is not a divide and conquer algorithm

5. ► Rabin-Karp algorithm reuses previously calculated hash values

6. ► Binary search performs in linear time

7. ► log(x) terms quite frequently appear during analysis

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

9. ► Brute force string matching relies on char by char comparison

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

11. ► Approximation algorithms provide bounds on the quality of the solution mathematically

12. ► Quick sort can be done in-place

13. ► Data structure needing large contiguous memory might fail to work even if that much memory is available

14. ► Average case complexity of Rabin-Karp is O(nm)

15. ► Dynamic programming also follows divide and conquer approach