Project One: Sorting Algorithm Visualizer

Sorting Algorithms:

• Bubble Sort: O(n²) time complexity, O(1) space complexity. Best for small, nearly sorted arrays.
• Selection Sort: O(n²) time complexity, O(1) space complexity. Suitable for small datasets.
• Insertion Sort: O(n²) time complexity, O(1) space complexity. Works well for nearly sorted arrays.
• Merge Sort: O(n log n) time complexity, O(n) space complexity. Ideal for larger datasets.
• Quick Sort: O(n log n) average time complexity, O(n²) worst-case time complexity, O(log n) space complexity. Efficient for most use cases.