Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- * program: bubsort.c
- * bubble sort
- *
- * FebriPratama, 2014
- *
- */
- #include <stdio.h>
- #define SIZE 8
- void bubsort(void);
- int n[SIZE];
- int wow[SIZE];
- int main(void) {
- int i;
- printf("data acak:\n");
- for(i = 0; i < SIZE; i++) {
- printf("data ke-%d: ", i);
- scanf("%d", &n[i]);
- wow[i]=n[i];
- }
- bubsort();
- printf("\ndata urut: ");
- for(i = 0; i < SIZE; i++)
- printf("%d ", n[i]);
- getch();
- }
- void bubsort(void) {
- int i,j,a,b,tmp,besar,kecil,datakecil,databesar;
- for(i = 0; i < SIZE - 1; i++) {
- for(j = 0; j < SIZE - i - 1; j++) {
- if(n[j] > n[j + 1]) {
- tmp = n[j];
- n[j] = n[j + 1];
- n[j + 1] = tmp;
- }
- }
- }
- besar=n[0];
- kecil=n[7];
- for(a = 0; a < SIZE - 1; a++) {
- if(wow[a]==besar){
- databesar=a;
- }
- }
- for(b = 0; b< SIZE - 1; b++) {
- if(wow[b]==kecil){
- datakecil=b;
- }
- }
- printf("\nNILAI MAKSIMAL SEBELUM: %d data ke %d",kecil,datakecil);
- printf("\nNILAI MINIMAL SEBELUM: %d data ke %d",besar,databesar);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement