This unit examines fundamental linear data structures, focusing on their abstract data types (ADTs) and common implementations. Linked lists are crucial for understanding dynamic memory allocation.
A look at efficient comparison-based sorting techniques. Quick Sort is known for its fast average-case performance, while Merge Sort guarantees O(n log n) complexity in the worst case.
The core concept for both is the Divide and Conquer paradigm.