mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-10-05 05:08:36 +00:00
47 lines
852 B
C
47 lines
852 B
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#define MAX 20
|
|
#define TRUE 1
|
|
#define FALSE 0
|
|
|
|
int main()
|
|
{
|
|
int i, arraySort[MAX] = {0}, isSort = FALSE, changePlace;
|
|
|
|
/* For example
|
|
Insertion random values in array to test
|
|
*/
|
|
|
|
for (i = 0; i < MAX; i++)
|
|
{
|
|
arraySort[i] = rand() % 101;
|
|
}
|
|
|
|
/* Algorithm of bubble methods */
|
|
|
|
while (isSort)
|
|
{
|
|
isSort = FALSE;
|
|
|
|
for (i = 0; i < MAX - 1; i++)
|
|
{
|
|
if (arraySort[i] > arraySort[i + 1])
|
|
{
|
|
changePlace = arraySort[i];
|
|
arraySort[i] = arraySort[i + 1];
|
|
arraySort[i + 1] = changePlace;
|
|
isSort = TRUE;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* See if it works */
|
|
|
|
for (i = 0; i < MAX; i++)
|
|
{
|
|
printf("%d\n", arraySort[i]);
|
|
}
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|