Buble Sort

bublesort-ascending.cpp

///buble sort
#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char** argv) {
    int number[5] = {5,4,2,1,4};
    int min = 0;
    
    cout<<"Sebelum urut";
    for(int i=0;i<5;i++){
        cout<<number[i];
    }
    //urut ascending
    for(int i=1;i<5;i++){
        for(int j=4;j>=i;j--){
            if(number[j]<number[j-1]){
                min = number[j];
                number[j]=number[j-1];
                number[j-1] = min;
            }
        }
    }
    
    for(int i=0; i<5;i++){
        cout<<number[i];
    }
}