https://enos.itcollege.ee/~japoia/algorithms/GT/Introduction_to_algorithms-3rd Edition.pdf

https://www.coursera.org/learn/algorithms-part1/home/module/1

https://www.coursera.org/learn/algorithms-part2/home/module/1

Week 1: Course Foundations & Big O Analysis

📚 Theory Checklist

• [x] Set up development environment and IDE
• [x] Review basic programming concepts (loops, functions, arrays)
• [x] Learn Big O notation: O(1), O(log n), O(n), O(n log n), O(n²), O(2^n)
• [x] Understand time vs space complexity trade-offs
• [x] Practice calculating complexity for simple algorithms

💻 Implementation Tasks

• [x] Implement bubble sort from scratch
• [x] Implement selection sort from scratch
• [x] Write complexity analysis for both algorithms
• [x] Create a timing function to measure actual performance

🧩 LeetCode Problems

Easy:

• 1. Two Sum - Hash table basics
  • Hash table
• 26. Remove Duplicates from Sorted Array - Array manipulation #TwoPointer
  • Standard