Computational complexity simply explained

In computer science and software engineering, we use the term “algorithmic complexity” or “computational complexity” to refer to how much time or space (e.g. memory) it takes to run a certain task or operation (or sequence of operations). Basically, it gives us an idea of how efficient (or inefficient) an algorithms is, and how many hardware resources would be required to execute a certain job. There are two types of computational complexity: time and space complexity. In this article, I will explain how to estimate the computational complexity of different algorithms, using some…