1. ► Dynamic programming also follows divide and conquer approach

2. ► Heap sort guarantees O(nlgn) performance

3. ► Heap sort makes use of heap data structure

4. ► Big-O notation has no hidden constant

5. ► Quick sort can be done in-place

6. ► Greedy algorithm works in bottom up manner

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

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

9. ► Memory access pattern may help in optimizing program for specific architectures

10. ► Fibonacci series can be calculated efficiently with dynamic programming

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

12. ► Connected component denotes close relationship among nodes

13. ► Binary search is there in algorithm package

14. ► Topological sort requires O(V) space

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