Data Structures and Algorithms Notes & Review 数据结构与算法笔记与复习
Tracking my pre-reading and study progress for COMP2521. Starting with fundamentals of Algorithm Analysis and Search. 记录我的 COMP2521 预习和学习进度。 从算法分析和搜索的基础知识开始。
Linear vs Binary Search. Sorted arrays and O(log n) efficiency. 线性搜索与二分搜索。有序数组与 O(log n) 效率。
The baseline comparison. Simple but slow O(n) search. 基础对照组。简单但较慢的 O(n) 搜索。
heap-buffer-overflow, use-after-free, uninitialized values. 堆缓冲区溢出、释放后使用、未初始化值。
C revision: array/list operations, pointer manipulation. C 语言复习：数组/链表操作、指针操作。
GCD, Fibonacci, listTail, listMax, listShift, listSum, listInsertOrdered, listInsertNth. Master recursive thinking with Lab 02. GCD、斐波那契、listTail、listMax 等。通过实验 02 掌握递归思维。
Selection, Bubble, Insertion, Merge, Quick & Radix Sort. Stability and complexity analysis. 选择、冒泡、插入、归并、快速与基数排序。稳定性与复杂度分析。
Properties, Traversals, Range and Closest Value. Tree recursion and iterative DFS/BFS. 树的属性、遍历、范围查找和最接近值。树递归和迭代式 DFS/BFS。
Adjacency lists, bidirectional friendships, mutual friends, recommendations. 邻接表、双向好友、共同好友、好友推荐。
🎯 Take Quiz做测验Graph search in mazes. visited/predecessor arrays and time complexity. 图搜索在迷宫中的应用。visited/predecessor 数组与时间复杂度。
🎯 Take Quiz做测验Hash functions, collision resolution via linear probing, backshift deletion, and LeetCode-style applications. 哈希函数、线性探测解决碰撞、回移删除，以及 LeetCode 风格的应用。
🎯 Take Quiz做测验Complete exam prep: Theory (Q6–Q12, 40 marks) and Coding (Q1–Q5, 60 marks). Hurdle requirements, key algorithms, and exam strategies. 完整备考：理论题（Q6–Q12，40 分）与编程题（Q1–Q5，60 分）。Hurdle 要求、核心算法与考试策略。