Bubble Sort
Time Complexity: O(n^2)
Space Complexity: O(1)
Process
Compare adjacent elements in the list and swap them if they are in the wrong order. Repeat this process until the entire list is sorted.
Efficiency
Simple but inefficient for large lists. It has a time complexity of O(n^2) in the worst case.