Algoritma Pemrograman 2 (Bubble sort)

Bubble sort =Pengurutan :

Irma.c

#include "irma.h"

voidInputArray(int A[],int MAX){

                int i;

                                for(i=0;i<MAX;i++){

                                                printf("A[%d]= ",i);

                                                scanf("%d",&A[i]);

                                }

                                printf("daftarangkaasli: \n");

}

voidCetakArray(int A[],int n){

                int j;

                for(j=0;j<n;j++){

                                printf("A[%d]= %d \n",j,A[j]);

                }

}

voidtukar(int A[], int b, inttmp){

                tmp=A[b];

                A[b]=A[b-1];

                A[b-1]=tmp;

}

voidBubleSort(int A[],int MAX){

                int a, b, tmp;

                                for(a=0;a<(MAX-1);a++){

                                                for (b=(MAX-1);b>=(a+1);b--){

                                                                if(A[b]<A[b-1]){

                                                                                tukar(A,b,tmp);

                                                                }

                                                }

                                }

                                printf("\n");

}

Irma.h

#include <stdio.h>

voidtukar();

voidInputArray();

voidCetakArray();

voidBubleSort();

main.c

#include "irma.h"

int main(){

                int MAX;

                printf("masukkanberapa array: ");

                scanf("%d",&MAX);

                int A[MAX];

                InputArray(A,MAX);      

                CetakArray(A,MAX);

                BubleSort(A,MAX);

                printf("setelahditukar: \n");

                CetakArray(A,MAX);

                getch();

                return 1;

}