Open In App

Python Program for Comb Sort

Last Updated : 09 Sep, 2023
Improve
Improve
Like Article
Like
Save
Share
Report

Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using a gap of the size of more than 1. The gap starts with a large value and shrinks by a factor of 1.3 in every iteration until it reaches the value 1. Thus

Comb Sort removes more than one inversion counts with one swap and performs better than Bubble Sort.

Python Program for Comb Sort

The shrink factor has been empirically found to be 1.3 (by testing Combsort on over 200,000 random lists) [Source: Wiki]
Although it works better than Bubble Sort on average, the worst case remains O(n2). 

Python3




# Python program for implementation of CombSort
 
# To find next gap from current
def getNextGap(gap):
 
    # Shrink gap by Shrink factor
    gap = (gap * 10)/13
    if gap < 1:
        return 1
    return gap
 
# Function to sort arr[] using Comb Sort
 
 
def combSort(arr):
    n = len(arr)
 
    # Initialize gap
    gap = n
 
    # Initialize swapped as true to make sure that
    # loop runs
    swapped = True
 
    # Keep running while gap is more than 1 and last
    # iteration caused a swap
    while gap != 1 or swapped == 1:
 
        # Find next gap
        gap = getNextGap(gap)
 
        # Initialize swapped as false so that we can
        # check if swap happened or not
        swapped = False
 
        # Compare all elements with current gap
        for i in range(0, n-gap):
            if arr[i] > arr[i + gap]:
                arr[i], arr[i + gap] = arr[i + gap], arr[i]
                swapped = True
 
 
# Driver code to test above
arr = [8, 4, 1, 3, -44, 23, -6, 28, 0]
combSort(arr)
 
print ("Sorted array:")
for i in range(len(arr)):
    print(arr[i]),
 






                        










Output


Sorted array:
-44 -6 0 1 3 4 8 23 28






Time Complexity: The worst-case complexity of this algorithm is O(n2).


Auxiliary Space: O(1).


Please refer complete article on Comb Sort for more details!




                                    


                                                                        

                                        

                                            

                                                

                                                    

        https://media.geeksforgeeks.org/auth/avatar.png
       
                                                

                                                

                                                    
    

        

            GeeksforGeeks
        

    
                                                

                                            

                                                                                    

                                        

                                            
    

        
        
    
                                            

                                                
                                                
                                            

                                            

                                            Improve
                                                
                                            

                                        

                                    



                            

                                                            

                                    
                                        
                                        Previous Article
                                    
                                    
                                    

                                        Python Program for Pigeonhole Sort
                                    

                                

                                                            

                                    
                                        Next Article
                                        
                                    
                                    
                                    

                                        Python Program for Iterative Merge Sort
                                    

                                

                                                        

                            

            

                

                    

                    
                
 
                
    
                            

                                

                            


                            


            

        
  
                        

                                                

                        
                                                    

                                
Similar Reads

                                

                                    
        
            

                
Python Program for Odd-Even Sort / Brick Sort

                
This is basically a variation of bubble-sort. This algorithm is divided into two phases- Odd and Even Phase. The algorithm runs until the array elements are sorted and in each iteration two phases occurs- Odd and Even Phases. In the odd phase, we perform a bubble sort on odd indexed elements and in the even phase, we perform a bubble sort on even i

            

            
            

                
                2 min read
            

        
    
        
            

                
Sort a Dictionary Without Using Sort Function in Python

                
As we all know Dictionaries in Python are unordered by default, which means they can’t be sorted directly. However, we can sort the keys or values of a dictionary and create a new sorted dictionary from the sorted keys or values. We can sort a list in a Dictionary using the inbuilt dictionary sort() function. But in this article, we will learn how

            

            
            

                
                3 min read
            

        
    
        
            

                
Python program to Sort a List of Tuples in Increasing Order by the Last Element in Each Tuple

                
The task is to write a Python Program to sort a list of tuples in increasing order by the last element in each tuple. Input: [(1, 3), (3, 2), (2, 1)] Output: [(2, 1), (3, 2), (1, 3)] Explanation: sort tuple based on the last digit of each tuple. Methods #1: Using sorted(). Sorted() method sorts a list and always returns a list with the elements in

            

            
            

                
                7 min read
            

        
    
        
            

                
Python Program for Selection Sort

                
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array. Python Program for Selection SortThe provided Python code demonstrates the Selection Sort algorithm. Selection Sort has a time

            

            
            

                
                2 min read
            

        
    
        
            

                
Python Program for Insertion Sort

                
Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. Python Program for Insertion SortThe insertionSort function takes an array arr as input. It first calculates the length of the array (n). If the length is 0 or 1, the function returns immediately as an array with 0 or 1 element is considered already

            

            
            

                
                2 min read
            

        
    
        
            

                
Python Program for Counting Sort

                
Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then do some arithmetic to calculate the position of each object in the output sequence. Python Program for Counting SortThe provided Python code demonstrates Counting Sort, a non-comp

            

            
            

                
                4 min read
            

        
    
        
            

                
Python Program for Radix Sort

                
In this article we are going to see Radix Sort with Python Radix Sort Algorithm PythonThe provided Python code implements Radix Sort, a non-comparative sorting algorithm that works by distributing elements into buckets based on their individual digits. The code defines a countingSort function, which performs counting sort based on the digit represe

            

            
            

                
                3 min read
            

        
    
        
            

                
Python Program for Counting Sort

                
Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence. C/C++ Code # Python program for counting sort # The main function that sort the given string

            

            
            

                
                2 min read
            

        
    
        
            

                
Python Program for Bitonic Sort

                
Bitonic Sequence: A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists an index i where 0&lt;=i&lt;=n-1 such that x0 &lt;= x1 …..&lt;= xi and xi &gt;= xi+1….. &gt;= xn-1 A sequence, sorted in increasing order is considered Bitonic with the decreasing part as empty.

            

            
            

                
                4 min read
            

        
    
        
            

                
Python Program for Bitonic Sort

                
Bitonic Sequence: A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists an index i where 0&lt;=i&lt;=n-1 such that x0 &lt;= x1 …..&lt;= xi and xi &gt;= xi+1….. &gt;= xn-1 A sequence, sorted in increasing order is considered Bitonic with the decreasing part as empty.

            

            
            

                
                4 min read
            

        
                                    

                                                                    
                                                            

                        

                        

                                                            

                                    
Article Tags : 

                                    
                                                                    

                                                                                

                                                

                                

                                    
                                                                    

                            


                        

                            

                                                                                    

                              

                            

                                                        
                        

                    

                

            

        
        


        

                




	
	
	

	
	

	
	    

	
	

	
	



                
        

    

    

        

            

            

        

    















	

    
  

  
  








    
        We use cookies to ensure you have the best browsing experience on our website. By using our site, you
        acknowledge that you have read and understood our
        Cookie Policy &
        Privacy Policy
            
    







   Lightbox