Select Menu

Search This Blog

Populer Posts Hari ini

Popular Posts

Powered by Blogger.

Lorem 1

adsense

" });

Circle Gallery

" });

News

" });
» » source code sorting Quick sort with C

kali ini saya akan berbagi kodingan pengurutan dengan metode quick sort. semoga bermanfaat...


#include <stdio.h>

void quickSort( int[], int, int);
int partition( int[], int, int);

int total;
void main(){
    int total;
    int a[1000];
    int i;
    printf("masukkan jumlah data total = ");scanf("%d",&total);

    for(i=0;i<total;i++){
       printf("masukkan data index ke %d = ",i+1);scanf("%d",&a[i]);
    }

    printf("\n\nsebelum Di- sorting:  ");
    for(i = 0; i < total; ++i){
       printf(" %d ", a[i]);
       quickSort( a, 0, total-1);
    }
    printf("\n\nsesudah Di- sorting: ");
    for(i = 0; i < total; ++i){
       printf(" %d ", a[i]);}
       printf("\n");
    }

    void quickSort( int a[], int l, int r){
       int j;

       if( l < r ){
          j = partition( a, l, r);
          quickSort( a, l, j-1);
          quickSort( a, j+1, r);
       }

    }

   int partition( int a[], int l, int r) {
       int pivot, i, j, t;
       pivot = a[l];
       i = l; j = r+1;
   
    while( 1){
       do ++i; while( a[i] <= pivot && i <= r );
       do --j; while( a[j] > pivot );
       if( i >= j ) break;
       t = a[i]; a[i] = a[j]; a[j] = t;
    }
     t = a[l]; a[l] = a[j]; a[j] = t;
     return j;
  }

About andi

«
Next
Newer Post
»
Previous
Older Post

No comments

Leave a Reply