BUBBLE SORT

 
BUBBLE SORT 
 
#include <stdio.h>
 
int main()
{
  int array[100], n, c, d, swap;
 
  printf("Enter number of elements\n");
  scanf("%d", &n);
 
  printf("Enter %d integers\n", n);
 
  for (c = 0; c < n; c++)
    scanf("%d", &array[c]);
 
  for (c = 0 ; c < ( n - 1 ); c++)
  {
    for (d = 0 ; d < n - c - 1; d++)
    {
      if (array[d] > array[d+1]) /* For decreasing order use < */
      {
        swap       = array[d];
        array[d]   = array[d+1];
        array[d+1] = swap;
      }
    }
  }
 
  printf("Sorted list in ascending order:\n");
 
  for ( c = 0 ; c < n ; c++ )
     printf("%d\n", array[c]);
 
  return 0;
}

Comments

  1. Swati Waghmare 2111:44 AM

    /*Bubble sort*/
    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1])
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete
  2. wadegaonkar aishwarya11:59 AM

    /*Bubble sort*/
    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1])
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete
  3. sushma jadhav12:00 PM

    /*Bubble sort*/
    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1])
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete
  4. poonam pusavale12:12 PM

    /*Bubble sort*/
    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1])
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete
  5. Bhosale Dhanashri SE312:20 PM

    /*Bubble sort*/
    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1])
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete
  6. pandhare dipali12:34 PM

    #include

    int main()
    {
    int array[100], n, c, d, swap;

    printf("Enter number of elements\n");
    scanf("%d", &n);

    printf("Enter %d integers\n", n);

    for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

    for (c = 0 ; c < ( n - 1 ); c++)
    {
    for (d = 0 ; d < n - c - 1; d++)
    {
    if (array[d] > array[d+1]) /* For decreasing order use < */
    {
    swap = array[d];
    array[d] = array[d+1];
    array[d+1] = swap;
    }
    }
    }

    printf("Sorted list in ascending order:\n");

    for ( c = 0 ; c < n ; c++ )
    printf("%d\n", array[c]);

    return 0;
    }

    ReplyDelete

Post a Comment