def comb_sort(nums):
    n = len(nums)
    gap = n
    shrink = 1.3
    sorted_ = False
    
    while not sorted_:
        gap = int(gap / shrink)
        if gap <= 1:
            gap = 1
            sorted_ = True
        
        i = 0
        while i + gap < n:
            if nums[i] > nums[i + gap]:
                nums[i], nums[i + gap] = nums[i + gap], nums[i]
                sorted_ = False
            i += 1
    
    return nums