Getting Started
Welcome to algorithms and data structures!
What Are Algorithms?
An algorithm is a step-by-step procedure for solving a problem.
Prerequisites
- Basic programming knowledge
- Understanding of basic math
- Familiarity with loops and conditionals
Learning Path
1. Foundations
- [ ] Arrays and Basic Operations
- [ ] Time and Space Complexity
- [ ] Binary Search implementation
- [ ] Binary Search practise tasks
2. Core Algorithms
- [ ] Quick Sort
- [ ] Dijkstra's Algorithm
Big O Notation
| Notation | Name | Example |
|---|---|---|
| \(O(1)\) | Constant | Array access |
| \(O(\log n)\) | Logarithmic | Binary search |
| \(O(n)\) | Linear | Linear search |
| \(O(n \log n)\) | Linearithmic | Merge sort |
| \(O(n^2)\) | Quadratic | Bubble sort |
Study Tips
- Code Along - Implement algorithms yourself
- Visualize - Draw data structures
- Practice - Solve problems daily
Ready? Start with Binary Search 🚀