This is a small project where I implemented various sorting algorithms. To test their efficiency, I used a random array consisting of 100,000 values and another array of 10,000,000 values to test the fastest algorithms.
- Time Complexity: O(n^2)
- Worst Case: O(n^2)
- Memory: 1
- Time Complexity: O(n log n)
- Worst Case: O(n^2)
- Memory: log n
- Time Complexity: O(n^2)
- Worst Case: O(n^2)
- Memory: 1
- Time Complexity: O(n log n)
- Worst Case: O(n log n)
- Memory: n
- Time Complexity: O(n^2)
- Worst Case: O(n^2)
- Memory: 1
- Time Complexity: O(n log n)
- Worst Case: O(n log n)
- Memory: n