Quick Sort
Time Complexity: O(n log n)
Space Complexity: O(log n)
Process
Iterate through the list and repeatedly take an element and insert it into its correct position in the already sorted part of the list.
Efficiency
Simple and efficient for small lists, but less practical for large lists. It has a time complexity of O(n^2) in the worst case.