mirror of https://github.com/TheAlgorithms/C
Merge pull request #18 from theycallmemac/patch-7
Rename OtherBubbleSort.c to Sorts/OtherBubbleSort.c
This commit is contained in:
commit
d357a45879
|
@ -0,0 +1,56 @@
|
|||
#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 = arratSort[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;
|
||||
|
||||
}
|
Loading…
Reference in New Issue