Algorithms are ubiquitous and are used in almost every aspect of our lives. Choosing the right algorithm for performing a specific task is no trivial matter. In the best case scenario, the algorithm not only performs its job, but it does it using the least amount of resources. The most relevant resources when it comes
Breadth-First Search (BFS) and Depth-First Search (DFS) are algorithms for traversing graphs. Traversal is the process of accessing each vertex (node) of a data structure in a systematic well-defined order. Choosing the algorithm depends on the type of data you are dealing with. There are generally two types of traversal and the main difference between
Both algorithms repeatedly execute a set of instructions. Recursion is a function that call itself repeatedly. Iteration is when a loop is executed repeatedly while certain condition is true. Differences between recursion and iteration: Recursion is a process applied on a function, iteration does not require a function.Infinite recursion can lead to system crash (stack
