Welcome to Algorithms and Data Structures Tutorial!
- Binary Search
The fastest way to find an element in a sorted list.
- Bubble Sort
How to push bubbles into right places in ϴ(n²) time!
- Insertion Sort
Sort in ϴ(n²) time by inserting element to its correct position, like in cards.
- Selection Sort
Sort in ϴ(n²) time by putting the next min/max element on the current position.
- Merge Sort
Fast, O(n log n) sorting with parallelization potential.
Another sorting that on average is O(n log n), but is easier to implement than merge sort.
- Graph representation
How to represent graphs inside your code!
- Sieve of Eratosthenes
Fast way to find small prime numbers.