Scribd Logo
Upload

Welcome to Scribd!

  • Bubble Sort Code

    Uploaded by

    Ajay Rewatkar
    4 views2 pages
    This C code uses a bubble sort algorithm to sort user-input integers in ascending order. The code prompts the user to enter the number of integers and then the integers themselves, stores them in an array, prints the unsorted array, uses nested for loops to compare and swap adjacent elements into ascending order, and finally prints the sorted array.

    Original Description:

    Original Title

    Bubble sort code

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C code uses a bubble sort algorithm to sort user-input integers in ascending order. The code prompts the user to enter the number of integers and then the integers themselves, stores them in an array, prints the unsorted array, uses nested for loops to compare and swap adjacent elements into ascending order, and finally prints the sorted array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views2 pages

    Bubble Sort Code

    Uploaded by

    Ajay Rewatkar
    This C code uses a bubble sort algorithm to sort user-input integers in ascending order. The code prompts the user to enter the number of integers and then the integers themselves, stores them in an array, prints the unsorted array, uses nested for loops to compare and swap adjacent elements into ascending order, and finally prints the sorted array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    #include<stdio.

    h>
    #include<conio.h>
    #define SIZE 100
    int main()
    {
    int i,j,temp,n;
    int a[SIZE];
    printf("How Many Numbers User Wants to sort : ");
    scanf("%d",&n);
    printf("Enter %d Numbers to Sort :\n ",n);
    for(i=0;i<n;i++)
    {
    scanf("%d",&a[i]);
    }
    printf("Before Sort : ");
    for(i=0;i<n;i++)
    {
    printf("% d",a[i]);
    }
    //Sort
    for(j=0;j<n;j++)
    {
    for(i=0;i<=j;i++)
    {
    if(a[i]>a[j])
    {
    temp=a[i];
    a[i]=a[j];
    a[j]=temp;
    }
    }

    }
    //Ascending//
    printf("\nOrder Using Bubble Sort : ");
    for(i=0;i<n;i++)
    {
    printf("% d",a[i]);

    }
    return 0;
    getch();
    }

    You might also like