Sorting Algorithms
Visualize how different sorting algorithms work step by step
Ready to sort
Algorithm Information
Select an algorithm to see its description and complexity analysis.
Searching Algorithms
Explore linear and binary search algorithms
Array generated. Enter a value to search for.
Algorithm Information
Linear Search checks each element sequentially until the target is found or the end is reached.
Binary Tree Operations
Build and traverse binary trees interactively
Tree is empty
Binary Tree Information
A binary tree is a hierarchical data structure where each node has at most two children.
Heap Operations
Visualize max heap and min heap operations
Heap is empty
Heap Information
A heap is a complete binary tree that satisfies the heap property.
Stack & Queue Operations
Understand LIFO and FIFO data structures
Structure is empty. Add elements to see operations.
Structure Information
A stack is a linear data structure that follows the Last In, First Out (LIFO) principle.
Hash Table Operations
Explore hash functions and collision handling
Hash table is empty. Insert key-value pairs to see hashing in action.
Hash Table Information
A hash table uses a hash function to map keys to indices in an array. Linear probing resolves collisions by finding the next available slot.