Big O notation is a mathematical concept used in computer science to analyze algorithm efficiency. It originated in mathematics but gained prominence in computer science in the 1970s, with Donald Knuth’s work. It simplifies the comparison of algorithms by quantifying their worst-case performance as input size increases. For instance, consider linear search (O(n)) versus binaryContinue reading “Big O Notation – Explained In 200 Words”
Tag Archives: competitive grogramming
Depth First Search (DFS): Unraveling Graphs Node by Node
Before discussing DFS, let’s make a scenary about you together. STORY Suppose you are in the living room sitting on your couch. Now suddenly you had a sudden urge to watch the new Rick & Morty TV series. To watch TV, you need to find the TV remote. You are certain that the TV remoteContinue reading “Depth First Search (DFS): Unraveling Graphs Node by Node”
Byronic 