Week 2
Module 1 Algorithms
Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: \(O\), \(\Omega\), \(\Theta\). Recursion.
- Lecture
- Audio
- Demos
- Notes
- Slides
- Source Code
- Subtitles
- Transcript
- Video
- Shorts
- Section 3
- Check for Understanding 3
- Problem Set 3
Module 2 Memory
Pointers. Segmentation Faults. Dynamic Memory Allocation. Stack. Heap. Buffer Overflow. File I/O. Images.
- Lecture
- Shorts
- Section 4
- Check for Understanding 4
- Problem Set 4