{"id":25206,"date":"2017-10-15T15:38:05","date_gmt":"2017-10-15T10:08:05","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25206"},"modified":"2017-10-15T15:38:05","modified_gmt":"2017-10-15T10:08:05","slug":"comb-sort","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/comb-sort\/","title":{"rendered":"Comb Sort"},"content":{"rendered":"

Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions<\/a> are removed one by one. Comb Sort improves on Bubble Sort by using gap of size 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<\/a> with one swap and performs better than Bublle Sort.<\/p>\n

The shrink factor has been empirically found to be 1.3 (by testing Combsort on over 200,000 random lists) [Source: Wiki<\/a>]\n

Although, it works better than Bubble Sort on average, worst case remains O(n2<\/sup>).<\/p>\n[ad type=”banner”]\n

Below is C++ implementation.<\/p>\n

c++<\/span> <\/div> 
\/\/ C++ implementation of Comb Sort#include<bits\/stdc++.h>using namespace std; \/\/ To find gap between elementsint getNextGap(int gap){    \/\/ Shrink gap by Shrink factor    gap = (gap*10)\/13;     if (gap < 1)        return 1;    return gap;} \/\/ Function to sort a[0..n-1] using Comb Sortvoid combSort(int a[], int n){    \/\/ Initialize gap    int gap = n;     \/\/ Initialize swapped as true to make sure that    \/\/ loop runs    bool swapped = true;     \/\/ Keep running while gap is more than 1 and last    \/\/ iteration caused a swap    while (gap != 1 || swapped == true)    {        \/\/ 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 (int i=0; i<n-gap; i++)        {            if (a[i] > a[i+gap])            {                swap(a[i], a[i+gap]);                swapped = true;            }        }    }} \/\/ Driver programint main(){    int a[] = {8, 4, 1, 56, 3, -44, 23, -6, 28, 0};    int n = sizeof(a)\/sizeof(a[0]);     combSort(a, n);     printf("Sorted array: \\n");    for (int i=0; i<n; i++)        printf("%d ", a[i]);     return 0;}<\/code><\/pre> <\/div>\n
JAVA<\/strong><\/p>\n
 
 java<\/span> <\/div> 
\/\/ Java program for implementation of Comb Sortclass CombSort{    \/\/ To find gap between elements    int getNextGap(int gap)    {        \/\/ Shrink gap by Shrink factor        gap = (gap*10)\/13;        if (gap < 1)            return 1;        return gap;    }     \/\/ Function to sort arr[] using Comb Sort    void sort(int arr[])    {        int n = arr.length;         \/\/ initialize gap        int gap = n;         \/\/ Initialize swapped as true to make sure that        \/\/ loop runs        boolean swapped = true;         \/\/ Keep running while gap is more than 1 and last        \/\/ iteration caused a swap        while (gap != 1 || swapped == true)        {            \/\/ 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 (int i=0; i<n-gap; i++)            {                if (arr[i] > arr[i+gap])                {                    \/\/ Swap arr[i] and arr[i+gap]                    int temp = arr[i];                    arr[i] = arr[i+gap];                    arr[i+gap] = temp;                     \/\/ Set swapped                    swapped = true;                }            }        }    }     \/\/ Driver method    public static void main(String args[])    {        CombSort ob = new CombSort();        int arr[] = {8, 4, 1, 56, 3, -44, 23, -6, 28, 0};        ob.sort(arr);         System.out.println("sorted array");        for (int i=0; i<arr.length; ++i)            System.out.print(arr[i] + " ");     }}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
PTHYON<\/strong><\/p>\n
 
 python<\/span> <\/div> 
# Python program for implementation of CombSort # To find next gap from currentdef getNextGap(gap):     # Shrink gap by Shrink factor    gap = (gap * 10)\/13    if gap < 1:        return 1    return gap # Function to sort arr[] using Comb Sortdef 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 abovearr = [ 8, 4, 1, 3, -44, 23, -6, 28, 0]combSort(arr) print ("Sorted array:")for i in range(len(arr)):    print (arr[i]), <\/code><\/pre> <\/div>\n
Output :<\/p>\n
Sorted array: \r\n-44 -6 0 1 3 4 8 23 28 56 \r\n<\/pre>\n
 <\/p>\n
Illustration:<\/strong><\/center>
\nLet the array elements be<\/p>\n
8, 4, 1, 56, 3, -44, 23, -6, 28, 0<\/pre>\n
Initially gap value = 10
\nAfter shrinking gap value => 10\/1.3 = 7<\/strong>;<\/p>\n
 8<\/strong> 4 1 56 3 -44 23 -6<\/strong> 28 0\r\n-6 4 1<\/strong> 56 3 -44 23  8 28 0<\/strong>\r\n-6 4 0 56 3 -44 23  8 28 1\r\n<\/pre>\n
New gap value => 7\/1.3 = 5<\/strong>;<\/p>\n
-44 4 0 56<\/strong> 3 -6 23 8 28<\/strong> 1\r\n-44 4 0 28 3<\/strong> -6 23 8 56<\/strong> 1\r\n-44 4 0 28 1 -6 23 8 56 3\r\n<\/pre>\n
New gap value => 5\/1.3 = 3<\/strong>;<\/p>\n
-44 1  0<\/strong> 28 4 -6<\/strong> 23 8 56 3\r\n-44 1 -6 28<\/strong> 4  0 23<\/strong> 8 56 3\r\n-44 1 -6 23 4  0 28<\/strong> 8 56 3<\/strong>\r\n-44 1 -6 23 4  0  3 8 56 28\r\n<\/pre>\n
New gap value => 3\/1.3 = 2<\/strong>;<\/p>\n
-44 1 -6 0 4<\/strong> 23 3<\/strong> 8 56 28\r\n-44 1 -6 0 3 23<\/strong> 4 8<\/strong> 56 28\r\n-44 1 -6 0 3 8 4 23 56 28\r\n<\/pre>\n
New gap value => 2\/1.3 = 1<\/strong>;<\/p>\n
-44 -6 1 0<\/strong> 3 8 4 23 56 28\r\n-44 -6 0 1 3 8 4<\/strong> 23 56 28\r\n-44 -6 0 1 3 4 8 23 56 28<\/strong>\r\n-44 -6 0 1 3 4 8 23 28 56 \r\n\r\nno more swaps required (Array sorted)\r\n<\/pre>\n
Time Complexity : <\/strong>Worst case complexity of this algorithm is O(n2<\/sup>) and the Best Case complexity is O(n).<\/p>\n
Auxiliary Space : <\/strong>O(1).<\/p>\n[ad type=”banner”]\n
 <\/p>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Comb Sort – Searching and Sorting – 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 gap of size more than 1.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,83506,71670],"tags":[70054,72103,72099,70052,70461,71135,71141,71130,70538,70780,70465,71151,71146,70905,70536,70497,72102,72104,71186,71181,70895,71138,72100,70271,70877,71216,70888,70262,71262,71289,71276,71165,71280,71288,71273,71270,71282,71281,71264,71283,72097,70046,71717,71722,71269,71120,71697,72055,70020,71161,70534,72101,71219,70560,70879,70882,70532,72098],"class_list":["post-25206","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-comb-sort","category-searching-and-sorting","tag-algorithm","tag-algorithm-for-bubble-sort-in-data-structure","tag-array-in-vba","tag-binary-search","tag-bubble-sort","tag-bubble-sort-algorithm-in-data-structure","tag-bubble-sort-animation","tag-bubble-sort-in-data-structure","tag-bubble-sort-time-complexity","tag-bubblesort","tag-bucket-sort","tag-bucket-sort-algorithm","tag-comparison-of-sorting-algorithms","tag-complexity-of-merge-sort","tag-complexity-of-sorting-algorithms","tag-counting-sort","tag-counting-sort-example","tag-define-comb","tag-difference-between-bubble-sort-and-insertion-sort","tag-difference-between-bubble-sort-and-selection-sort","tag-fastest-sorting-algorithm","tag-flowchart-for-bubble-sort","tag-function-in-vba","tag-heap-sort","tag-heap-sort-time-complexity","tag-insertion-sort","tag-insertion-sort-time-complexity","tag-merge-sort","tag-merge-sort-algorithm","tag-merge-sort-algorithm-in-c","tag-merge-sort-algorithm-with-example","tag-merge-sort-c","tag-merge-sort-c-code","tag-merge-sort-c-program","tag-merge-sort-code","tag-merge-sort-example","tag-merge-sort-explained","tag-merge-sort-program","tag-merge-sort-program-in-c","tag-program-for-merge-sort","tag-pseudocode","tag-quicksort","tag-quicksort-animation","tag-quicksort-explanation-with-example","tag-radix-sort","tag-selection-sort","tag-shell-sort","tag-shell-sort-algorithm","tag-sorting-algorithms","tag-sorting-algorithms-comparison","tag-sorting-algorithms-complexity","tag-sorting-algorithms-pdf","tag-sorting-in-c","tag-space-complexity-of-merge-sort","tag-time-complexity-of-heap-sort","tag-time-complexity-of-insertion-sort","tag-time-complexity-of-sorting-algorithms","tag-vba-array"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25206","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25206"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25206\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25206"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25206"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25206"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}