Subject Library
Explore free, community-made reviewer notes and practice quizzes for Data Structures and Algorithms.
Quality public notes ranked by engagement and freshness.
Applies to 4 programs
Comparing Algorithm Efficiency Informally 📘 Overview Algorithm efficiency compares the time and memory required to solve the same problem as input size grows. Counting signific...
Applies to 4 programs
Static versus Dynamic Data Structure Implementations 📘 Overview Static implementations have fixed capacity, whereas dynamic implementations can change their capacity or node co...
Applies to 4 programs
Linked Lists: Nodes and Links 📘 Overview A linked list stores elements in nodes connected by references rather than in contiguous array positions. Its structure supports effici...
Applies to 4 programs
Linked List Operations in C++ 📘 Overview A singly linked list stores nodes connected by next pointers, with a head pointer identifying the first node. Operations depend on pres...
Applies to 4 programs
Linear and Binary Search 📘 Overview Linear search examines elements sequentially, whereas binary search repeatedly halves a sorted search interval. Their worst-case running tim...
Applies to 4 programs
Elementary Sorting: Bubble, Selection and Insertion 📘 Overview Bubble, selection, and insertion sort are comparison-based algorithms with quadratic average-case running time. T...
