- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity ♣
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Data Structures / Time Complexity »
Big O notation is a concept borrowed from mathematics. Big O is focusing on the steps required, not time. Binary search O(log N) is faster than linear search O(N).
What is time complexity, or big O notation? Is big O focusing on the runtime? Which one is faster, O(N) or O(log N)?
Click to Flip Card
