C Program to implement Bubble Sort. Sinking sort is the another name of Bubble sort. This algorithm repeatedly iterates through the array, compares each pair of adjacent elements and swaps them if the 1st element is larger than 2nd.

#include <stdio.h>

int main(){

int array[] = {1,45,10,35,100,13,147,500,80};
int size = sizeof(array)/sizeof(array[0]);

int i,j,min;

for (i = 0; i < size ; i++){
    
    for(j = 0  ; j < size - i ; j++){
        
        if(array[j] > array[j+1]){
            
            min = array[j];
            array[j] = array[j+1];
            array[j+1] = min;
            
        }
    }
    
}


for(i = 0 ; i < size ; i++){
    printf("%d
",array[i]);
}


return 0;

}

1
10
13
35
45
80
100
147
500