OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

code cleanup & fixed syntax error

Browse Source
This commit is contained in:
Krishna Vedala 2020-04-07 18:29:24 -04:00
parent a3989bbadc
commit cee2468506
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 24 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
sorting/Bubble_Sort_2.c
View File

@ -4,53 +4,44 @@
#define TRUE 1
#define FALSE 0
int main()
{
int i , arraySort[MAX] ={0} , isSort = FALSE, changePlace;
int i, arraySort[MAX] = {0}, isSort = FALSE, changePlace;
/* For example
Insertion random values in array to test
*/
for(i = 0 ; i < MAX; i++)
for (i = 0; i < MAX; i++)
{
arraySort[i] = rand()%101 ;
arraySort[i] = rand() % 101;
}
/* Algorithm of bubble methods */
/* Algorithm of bubble methods */
while(isSort)
while (isSort)
{
isSort = FALSE;
for( i = 0 ; i < MAX - 1 ; i++)
for (i = 0; i < MAX - 1; i++)
{
if(arraySort[i] > arraySort[i+1])
if (arraySort[i] > arraySort[i + 1])
{
changePlace = arratSort[i];
arraySort[i] = arraySort[i+1];
arraySort[i+1] = changePlace ;
changePlace = arraySort[i];
arraySort[i] = arraySort[i + 1];
arraySort[i + 1] = changePlace;
isSort = TRUE;
}
}
}
/* See if it works */
for(i = 0 ; i < MAX; i++)
for (i = 0; i < MAX; i++)
{
printf("%d\n", arraySort[i]);
}
return EXIT_SUCCESS;
}