An algorithm is a set of finite rules or instructions to be followed in calculations or other problem-solving operations. It refers to a sequence of finite steps to solve a particular problem. Algorithms are used to solve a wide range of problems and tasks, from the mundane to the complex. They are language-independent, meaning they are just plain instructions that can be implemented in any programming language. Algorithm analysis refers to how to investigate the effectiveness of the algorithm in terms of time and space complexity. The fundamental purpose of algorithm evaluation is to decide how much time and space an algorithm needs to solve the problem as a feature of the scale of the input. Algorithm analysis is crucial because it facilitates us to examine different strategies and pick the best one for a given problem. There are many approaches to research the time and space of algorithms, including big O notation, big Omega notation, and big Theta notation.