Scribd Logo
Upload

Welcome to Scribd!

  • Harsh DS Practical 25

    Uploaded by

    pateldevam1647
    14 views4 pages
    This document contains code to implement the Shell sort algorithm. It includes a function called "sort" that takes an integer array and size as parameters. The sort function uses a gap to sort the array, starting with n/2 and dividing by 2 on each pass, until the gap is 0. It also includes a main function that takes user input for the array size and elements, calls the sort function, and prints the sorted array.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code to implement the Shell sort algorithm. It includes a function called "sort" that takes an integer array and size as parameters. The sort function uses a gap to sort the array, starting with n/2 and dividing by 2 on each pass, until the gap is 0. It also includes a main function that takes user input for the array size and elements, calls the sort function, and prints the sorted array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    14 views4 pages

    Harsh DS Practical 25

    Uploaded by

    pateldevam1647
    This document contains code to implement the Shell sort algorithm. It includes a function called "sort" that takes an integer array and size as parameters. The sort function uses a gap to sort the array, starting with n/2 and dividing by 2 on each pass, until the gap is 0. It also includes a main function that takes user input for the array size and elements, calls the sort function, and prints the sorted array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Enrollment No.

    :- 2161370307040

    Practical 25
    Aim :- Implement Shell sort algorithm.

    Page 1 of 4
    Enrollment No. :- 2161370307040

    Practical 25
    Aim :- Implement Shell sort algorithm.

    Page 2 of 4
    Enrollment No. :- 2161370307040

    Practical 25
    Aim :- Implement Shell sort algorithm.

    #include<stdio.h>
    #include<conio.h>
    void sort(int a[], int n)
    {
    int gap, i, j, temp;
    for(gap=n/2;gap>0;gap/=2)
    {
    for(i=gap; i<n; i+=1)
    {
    temp=a[i];
    for(j=i; j>=gap&&a[j-gap]>temp;j-=gap)
    a[j]=a[j-gap];
    a[j]=temp;
    }
    }
    }
    int main()
    {
    int a[20], i, n;
    clrscr();
    printf("Enter number of element : ");
    scanf("%d",&n);

    Page 3 of 4
    Enrollment No. :- 2161370307040

    printf("Enter the emement inn the array : ");


    for(i=0; i<n; ++i)
    {
    scanf("%d",&a[i]);
    }
    sort(a, n);
    printf("Array after shell sort : ");
    for(i=0; i<n; ++i)
    {
    printf("%d \n",a[i]);
    }
    getch();
    return 0;
    }

    Page 4 of 4

    You might also like