Skip to content

Instantly share code, notes, and snippets.

@RianWardana
Created September 27, 2017 02:11
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save RianWardana/b059492e4f62aae1f616c049e5bb8dcb to your computer and use it in GitHub Desktop.
Save RianWardana/b059492e4f62aae1f616c049e5bb8dcb to your computer and use it in GitHub Desktop.
// Nurian S Wardana
// Bubble sort array
#include <stdio.h>
void urutkanArray(int array[], int arrayLength) {
int lastIndex = arrayLength - 1;
int i, j, k, dummy;
for (i = 0; i < arrayLength; i++) {
for (j = lastIndex; j > i; j--) {
dummy = array[j];
if (array[j] < array[j-1]) {
array[j] = array[j-1];
array[j-1] = dummy;
}
}
printf("\n\nPutaran ke-%d\n", i + 1);
for (k = 0; k < arrayLength; k++) printf("%d ", array[k]);
}
}
int main() {
int array[] = {6,4,3,2,1};
int arrayLength = sizeof(array) / sizeof(int);
int k;
printf("Sebelum sorting\n");
for (k = 0; k < arrayLength; k++) printf("%d ", array[k]);
printf("\n");
urutkanArray(array, arrayLength);
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment