Sorting Algorithms Visualizer
Visualize and compare different sorting algorithms in action
Visualization
Selection Sort - Array size: 0
Sorting Algorithms
// Select an algorithm to see its implementation// Each algorithm has different characteristics and trade-offs
Controls
Configure and control the sorting visualization
550
FastSlow
Algorithm Information
Selection Sort
Finds the minimum element in unsorted portion and swaps it with the first unsorted element.
Complexity Analysis
Time Complexity:O(n²)
Space Complexity:O(1)
Stability:Not Stable
Applications
- When memory write is costly
- Small datasets
- Educational purposes
From CSC508 Course Notes
Brute-force algorithms: Selection Sort (O(n²)), Insertion Sort (O(n²))
Divide & conquer: Merge Sort (O(n log n)), Heap Sort (O(n log n))
Sorting rearranges elements in ascending or descending order to improve operations like searching.