68 lines
1.3 KiB
C
68 lines
1.3 KiB
C
|
/*
|
||
|
|
* C program to sort N numbers in ascending order using Bubble sort
|
||
|
|
* and print both the given and the sorted array
|
||
|
|
*/
|
||
|
|
#include <stdio.h>
|
||
|
|
#define MAXSIZE 10
|
||
|
|
|
||
|
|
void main()
|
||
|
|
{
|
||
|
|
int array[MAXSIZE];
|
||
|
|
int i, j, num, temp;
|
||
|
|
printf("Enter the value of num \n");
|
||
|
|
scanf("%d", &num);
|
||
|
|
printf("Enter the elements one by one \n");
|
||
|
|
for (i = 0; i < num; i++)
|
||
|
|
{
|
||
|
|
scanf("%d", &array[i]);
|
||
|
|
}
|
||
|
|
printf("Input array is \n");
|
||
|
|
for (i = 0; i < num; i++)
|
||
|
|
{
|
||
|
|
printf("%d\n", array[i]);
|
||
|
|
}
|
||
|
|
/* Bubble sorting begins */
|
||
|
|
for (i = 0; i < num; i++)
|
||
|
|
{
|
||
|
|
for (j = 0; j < (num - i - 1); j++)
|
||
|
|
{
|
||
|
|
if (array[j] > array[j + 1])
|
||
|
|
{
|
||
|
|
temp = array[j];
|
||
|
|
array[j] = array[j + 1];
|
||
|
|
array[j + 1] = temp;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
printf("Sorted array is...\n");
|
||
|
|
for (i = 0; i < num; i++)
|
||
|
|
{
|
||
|
|
printf("%d\n", array[i]);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/*
|
||
|
|
*OUTPUT:
|
||
|
|
Enter the value of num
|
||
|
|
6
|
||
|
|
Enter the elements one by one
|
||
|
|
23
|
||
|
|
45
|
||
|
|
67
|
||
|
|
89
|
||
|
|
12
|
||
|
|
34
|
||
|
|
Input array is
|
||
|
|
23
|
||
|
|
45
|
||
|
|
67
|
||
|
|
89
|
||
|
|
12
|
||
|
|
34
|
||
|
|
Sorted array is...
|
||
|
|
12
|
||
|
|
23
|
||
|
|
34
|
||
|
|
45
|
||
|
|
67
|
||
|
|
89
|
||
|
|
*/
|