/*
Author : Jemmy R. Mongi
File : Bubble.cpp
*/
Author : Jemmy R. Mongi
File : Bubble.cpp
*/
#include <stdio.h>
#include <stdlib.h>
/* prototipe
fungsi bubbleSort */
int
bubbleSort(int *, int);
int main() {
printf("***BUBBLE SORT***\n\n");
/* minta user menginput jumlah elemen array
*/
printf("Masukan jumlah elemen:
");
int n;
scanf("%d", &n);
/* deklarasi array dengan jumlah elemen
sebanyak input user */
int A[n];
/* input nilai pada elemen-elemen array */
int input;
for (input = 0; input < n; input++) {
printf("A[%d]: ", input);
scanf("%d", &A[input]);
}
system("cls");
/* tampilkan nilai elemen-elemen array
sebelum disortir */
printf("Nilai elemen-elemen array
sebelum disortir\n");
int before;
for (before = 0; before < n; before++)
printf("A[%d] = %d\n",
before, A[before]);
/* panggil fungsi bubbleSort */
bubbleSort(A, n);
/* tampilkan nilai elemen-elemen array
setelah disortir */
printf("\nNilai elemen-elemen array
setelah disortir\n");
int after;
for (after = 0; after < n; after++)
printf("A[%d] = %d\n", after,
A[after]);
system("pause");
return 0;
}
/* body fungsi
bubbleSort */
int
bubbleSort(int *A, int n) {
int i;
for (i = 1; i <= n-1; i++) {
int j;
for (j = n-1; j >= i; j--) {
if (A[j] < A[j-1]) {
int temp = A[j];
A[j] = A[j-1];
A[j-1] = temp;
}/* if */
}/* for j */
}/* for i */
}/* fungsi
bubbleSort() */
No comments:
Post a Comment