- Divide and Conquer
Divide and Conquer is a very popular algorithm that many people use to solve problems. With Divide and Conquer, a problem in hand, is divided into smaller sub-problems and then each problem is solved independently. When we keep on dividing the subproblems into even smaller sub-problems, we may…
- Big Omega Notation
The Omega notation represents the lower bound of the running time of an algorithm. It provides the best case complexity of an algorithm. So if we represent a complexity of an algorithm in Omega notation, it means that the algorithm cannot be completed in less time than this, it would at least take…
- Algorithm interview – Big O
Big O is about how long an algorithm takes to run from start to end and how well it scales based on the size of the input or dataset. Big O is mostly measured based on the worst-case scenario even though some algorithms might finish early based on some logic. Here is another graph […]
- Big O Notation
Big O is about how long an algorithm takes to run from start to end and how well it scales as the size of the input or dataset increases. Big O is mostly measured based on the worst-case scenario even though some algorithms might finish earlier than others. Here is another graph for more clarity.…
- Introduction
Data Structures A data structure is exactly what it sounds like — a structure that holds data. Unlike variables, which only hold a single point of data, data structures collect one or more points of data of the same type. Although a data structure can hold many points of data, a data structure,…