Data Structures Lab
A curated portfolio of data structure experiments, demonstrating Arrays, Linked Lists, Stacks, Queues, and Algorithms.
Fundamentals
Arrays & Matrices
Foundational operations on arrays including matrix multiplication, student marks analysis, and pair counting algorithms.
View CodeString Manipulation
Essential string processing algorithms: word reversal, character counting, and pattern replacement without standard libraries.
View CodeLinked Data Structures
Linked Lists
Dynamic memory allocation implementations: Singly Linked Lists, Doubly Linked Lists, and Circular Linked Lists.
View CodeStack Operations
LIFO structure applications involving expression evaluation (Postfix/Prefix) and syntax parsing algorithms.
View CodeAdvanced Structures
Queues
FIFO implementation variants: Circular Queues, Double-Ended Queues (Deque), and Priority Queues.
View CodeSearching & Sorting
Performance optimization algorithms: Binary Search, Quick Sort, Merge Sort, and Insertion Sort implementations.
View CodeInteractive Demo
Bubble Sort O(n²)
Watch the Bubble Sort algorithm in action. Repeatedly compares adjacent elements and swaps them if they are in the wrong order.