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)