Time & Space Complexity — Notes

Beginner-friendly notes on Big-O time and space complexity: O(1), O(n), O(log n), O(n log n), O(n²), O(2ⁿ), with swap, loops, binary search, merge sort, and Fibonacci examples—plus quick rules to revise fast.