------
## 最终结论
```python
def comb_sort(arr):
    gap = len(arr)
    sorted = False
    shrink_factor = 1.3

    while not sorted:
        gap = max(1, int(gap / shrink_factor))
        sorted = True

        for i in range(len(arr) - gap):
            if arr[i] > arr[i + gap]:
                arr[i], arr[i + gap] = arr[i + gap], arr[i]
                sorted = False

    return arr

# Test cases
assert comb_sort([5, 15, 37, 25, 79]) == [5, 15, 25, 37, 79]
assert comb_sort([41, 32, 15, 19, 22]) == [15, 19, 22, 32, 41]
assert comb_sort([99, 15, 13, 47]) == [13, 15, 47, 99]
```