Data Structures & Algorithms

DS&A studies how to represent data and design algorithms that scale. The notes below are grouped by concept cluster - start with an overview note where one exists, then follow links into specifics. The full file list follows automatically below.

Foundations

• Recursion - recursive thinking, base cases, stack frames
• Functions - abstraction, composition, parameter passing
• Pass by Value & Reference
• Pointers & Functions
• Bitwise Operations - operators, masks, bit tricks

Complexity & Analysis

• Algorithm Efficiency - bridging theory and practice
• Asymptotic Notation - O, Θ, Ω, o, ω
• Time Complexity Analysis
• Time & Space Complexity
• Time Complexity Calculation
• Space Complexity
• Best, Worst & Average Cases
• Amortized Analysis
• Recurrence Relations
• Master Theorem

Linear Data Structures

Arrays

• Arrays - Operations - Dynamic Arrays
• Multidimensional Arrays - Matrices
• Strings

Linked Lists

• Linked List - Doubly Linked - Circular
• Linked List Operations - Searching

Stacks

• Stack - Push & Pop
• Array Implementation - Linked List Implementation
• Stack via Queue

Queues

• Queue - Enqueue & Dequeue
• Array Implementation - Linked List Implementation
• Circular Queue - Deque - Priority Queue

Hash-Based

• Hash Tables - Maps & Hash Tables

Trees & Heaps

Trees

• Trees Overview - Binary Tree - Types of Binary Tree
• Tree Traversal - Preorder - Inorder - Postorder
• Binary Search Tree
• AVL Tree - AVL Rotations
• Red-Black Tree - Splay Tree
• B-Tree - B+ Tree

Tries

• Tries Overview - Types of Tries
• Standard Trie - Compressed Trie - Suffix Trie

Heaps

• Heaps Overview - Binary Heap - D-ary Heap
• Heapify - Insert & Delete
• Heapsort

Graphs

• Graphs Overview
• Representations - Adjacency List - Adjacency Matrix
• Traversals (BFS & DFS) - BFS - DFS
• Dijkstra’s Algorithm - Floyd-Warshall
• Minimum Spanning Trees - Kruskal’s - Prim’s
• Topological Sorting - Disjoint Set (Union-Find)

Sorting & Searching

Sorting

• Sorting Overview
• Bubble Sort - Insertion Sort - Selection Sort
• Merge Sort - Quick Sort - Heapsort
• Counting Sort - Bucket Sort - Radix Sort
• External Sorting

Searching

• Searching Overview
• Linear Search - Binary Search - Ternary Search

Algorithmic Paradigms

• Divide & Conquer
• Dynamic Programming - Knapsack Problem
• Greedy Algorithms - Huffman Coding
• Backtracking
• Branch & Bound
• Constraint Satisfaction

Math Foundations

• Math Overview
• Logarithmic Functions
• Prime Number Algorithms
• Square Root Algorithms
• Euclidean Algorithms - HCF & LCM
• Bit Manipulation

Memory & Data Layout

• Memory Allocation - Dynamic Memory Allocation

The full file listing follows below, generated automatically by Quartz.