In this chapter, we covered big O notation and also discussed how we can calculate the complexity of an algorithm by applying this concept. We introduced the NP-completeness theory, a concept that you can delve into if you are interested in learning more about solving impossible problems and using heuristics for an approximately satisfactory solution.
We also presented some websites on which you can register for free, apply all the knowledge you acquired while reading this book, and even be offered your first job in IT!
Happy coding!
