Bubble Sort
Compare adjacent elements and swap if needed
O(n²)Visualize →
Quick Sort
Divide and conquer sorting algorithm
O(n log n)Visualize →
Merge Sort
Stable divide and conquer sorting
O(n log n)Visualize →
Heap Sort
Heap-based sorting algorithm
O(n log n)Visualize →
Selection Sort
Find minimum and place at beginning
O(n²)Visualize →
Insertion Sort
Build sorted array one element at a time
O(n²)Visualize →
Binary Search
Search in sorted array by dividing
O(log n)Visualize →
Linear Search
Sequential search through elements
O(n)Visualize →
Understanding Array Algorithms
Sorting Algorithms
- • Bubble Sort: Simple but inefficient O(n²)
- • Quick Sort: Fast average case O(n log n)
- • Merge Sort: Stable and consistent O(n log n)
- • Heap Sort: In-place O(n log n)
Search Algorithms
- • Linear Search: Works on any array O(n)
- • Binary Search: Requires sorted array O(log n)