{"id":25200,"date":"2017-10-15T15:33:29","date_gmt":"2017-10-15T10:03:29","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25200"},"modified":"2017-10-15T15:33:29","modified_gmt":"2017-10-15T10:03:29","slug":"shellsort","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/shellsort\/","title":{"rendered":"ShellSort"},"content":{"rendered":"

ShellSort is mainly a variation of Insertion Sort<\/a>.<\/span> In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved. The idea of shellSort is to allow exchange of far items. In shellSort, we make the array h-sorted for a large value of h. We keep reducing the value of h until it becomes 1. An array is said to be h-sorted if all sublists of every h\u2019th element is sorted.<\/p>\n

Following is C++ implementation of ShellSort.<\/p>\n

\n
\n
\u00a0C<\/strong><\/div>\n
\n
c<\/span> <\/div> 
\/\/ C++ implementation of Shell Sort#include  <iostream>using namespace std; \/* function to sort arr using shellSort *\/int shellSort(int arr[], int n){    \/\/ Start with a big gap, then reduce the gap    for (int gap = n\/2; gap > 0; gap \/= 2)    {        \/\/ Do a gapped insertion sort for this gap size.        \/\/ The first gap elements a[0..gap-1] are already in gapped order        \/\/ keep adding one more element until the entire array is        \/\/ gap sorted         for (int i = gap; i < n; i += 1)        {            \/\/ add a[i] to the elements that have been gap sorted            \/\/ save a[i] in temp and make a hole at position i            int temp = arr[i];             \/\/ shift earlier gap-sorted elements up until the correct             \/\/ location for a[i] is found            int j;                        for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)                arr[j] = arr[j - gap];                         \/\/  put temp (the original a[i]) in its correct location            arr[j] = temp;        }    }    return 0;} void printArray(int arr[], int n){    for (int i=0; i<n; i++)        cout << arr[i] << " ";} int main(){    int arr[] = {12, 34, 54, 2, 3}, i;    int n = sizeof(arr)\/sizeof(arr[0]);     cout << "Array before sorting: \\n";    printArray(arr, n);     shellSort(arr, n);     cout << "\\nArray after sorting: \\n";    printArray(arr, n);     return 0;}<\/code><\/pre> <\/div>\n<\/div>\n
\n[ad type=”banner”]\n
JAVA<\/strong><\/p>\n
 
 java<\/span> <\/div> 
\/\/ Java implementation of ShellSortclass ShellSort{    \/* An utility function to print array of size n*\/    static void printArray(int arr[])    {        int n = arr.length;        for (int i=0; i<n; ++i)            System.out.print(arr[i] + " ");        System.out.println();    }     \/* function to sort arr using shellSort *\/    int sort(int arr[])    {        int n = arr.length;         \/\/ Start with a big gap, then reduce the gap        for (int gap = n\/2; gap > 0; gap \/= 2)        {            \/\/ Do a gapped insertion sort for this gap size.            \/\/ The first gap elements a[0..gap-1] are already            \/\/ in gapped order keep adding one more element            \/\/ until the entire array is gap sorted            for (int i = gap; i < n; i += 1)            {                \/\/ add a[i] to the elements that have been gap                \/\/ sorted save a[i] in temp and make a hole at                \/\/ position i                int temp = arr[i];                 \/\/ shift earlier gap-sorted elements up until                \/\/ the correct location for a[i] is found                int j;                for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)                    arr[j] = arr[j - gap];                 \/\/ put temp (the original a[i]) in its correct                \/\/ location                arr[j] = temp;            }        }        return 0;    }     \/\/ Driver method    public static void main(String args[])    {        int arr[] = {12, 34, 54, 2, 3};        System.out.println("Array before sorting");        printArray(arr);         ShellSort ob = new ShellSort();        ob.sort(arr);         System.out.println("Array after sorting");        printArray(arr);    }} <\/code><\/pre> <\/div>\n
PYTHON<\/strong><\/p>\n
 
 python<\/span> <\/div> 
# Python program for implementation of Shell Sort def shellSort(arr):     # Start with a big gap, then reduce the gap    n = len(arr)    gap = n\/2     # Do a gapped insertion sort for this gap size.    # The first gap elements a[0..gap-1] are already in gapped     # order keep adding one more element until the entire array    # is gap sorted    while gap > 0:         for i in range(gap,n):             # add a[i] to the elements that have been gap sorted            # save a[i] in temp and make a hole at position i            temp = arr[i]             # shift earlier gap-sorted elements up until the correct            # location for a[i] is found            j = i            while  j >= gap and arr[j-gap] >temp:                arr[j] = arr[j-gap]                j -= gap             # put temp (the original a[i]) in its correct location            arr[j] = temp        gap \/= 2  # Driver code to test abovearr = [ 12, 34, 54, 2, 3] n = len(arr)print ("Array before sorting:")for i in range(n):    print(arr[i]), shellSort(arr) print ("\\nArray after sorting:")for i in range(n):    print(arr[i]), <\/code><\/pre> <\/div>\n<\/div>\n<\/div>\n<\/div>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
ShellSort – Searching and Sorting – ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,71670,83505],"tags":[70054,2380,70478,71995,72054,70052,70263,70273,70268,71987,70461,71121,70978,71122,71129,70780,71993,70465,71151,70497,71868,70048,71144,70507,70271,70928,71216,70017,70979,71225,70969,34643,70262,71262,71263,71281,71267,70046,71145,71269,71266,71870,72056,71120,70016,70964,70965,71697,72055,71674,71125,71162,71695,70020,70019,70967,71156,72053,71990,72052],"class_list":["post-25200","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-searching-and-sorting","category-shellsort","tag-algorithm","tag-array-sort","tag-avl-tree","tag-bein-sport","tag-best-sorting-algorithm-in-java","tag-binary-search","tag-binary-search-tree","tag-binary-sort","tag-binary-tree","tag-bitbucket","tag-bubble-sort","tag-bubble-sort-algorithm","tag-bubble-sort-c","tag-bubble-sort-java","tag-bubble-sort-program","tag-bubblesort","tag-bucket","tag-bucket-sort","tag-bucket-sort-algorithm","tag-counting-sort","tag-counting-sort-algorithm","tag-data-structures","tag-different-sorting-algorithms","tag-hash-table","tag-heap-sort","tag-heap-sort-algorithm","tag-insertion-sort","tag-insertion-sort-algorithm","tag-insertion-sort-c","tag-insertion-sort-program","tag-java-sorting-algorithms","tag-keyword","tag-merge-sort","tag-merge-sort-algorithm","tag-merge-sort-java","tag-merge-sort-program","tag-quick-sort-algorithm","tag-quicksort","tag-quicksort-c","tag-radix-sort","tag-radix-sort-algorithm","tag-radix-sort-algorithm-in-data-structure","tag-radix-sort-example-step-by-step","tag-selection-sort","tag-selection-sort-algorithm","tag-selection-sort-code","tag-selection-sort-program","tag-shell-sort","tag-shell-sort-algorithm","tag-sort","tag-sort-code","tag-sort-java","tag-sorted","tag-sorting-algorithms","tag-sorting-algorithms-in-java","tag-sorting-algorithms-java","tag-sorting-algorithms-with-examples","tag-sorting-in-java","tag-sorting-techniques-in-java","tag-types-of-sorting"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25200","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=25200"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25200\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25200"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25200"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25200"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}