1. ► Greedy algorithm doesn’t guarantee global optimal

2. ► Exact figures of memory usage is not important

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

4. ► For overlapping optimal substructure, dynamic programming gives optimal solution

5. ► Frequent cheap operations compensate expensive operations

6. ► Binary is not a divide and conquer algorithm

7. ► Good data structure make programs more efficient

8. ► Strongly connected component term is used in the context of directed graphs

9. ► Dynamic arrays can be proven to have constant time complexity with amortized analysis

10. ► Smaller order terms cannot be ignored in analysis for small data set

11. ► String matching is quite common in scripting languages

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

13. ► Binary search is there in algorithm package

14. ► Big-O notation has no hidden constant

15. ► Dijkstra’s algorithm makes best available solution choice at each step