PKN LPKIA BANDUNG

Mata Kuliah : Teori Strukturdata
Nama Dosen : Dadan N. Bagenda

Selasa, 25 Mei 2010

CONTOH PROGRAM SORTING

bubble sort
#include "stdio.h"
#include "iostream.h"
#include "conio.h"

int main(){
clrscr();
int A[5]={3,4,1,2,8},i,j,tampung;

for (i=0;i<5;i++){
for(j=5-1;j>=i;j--){
if (A[j] tampung=A[j];
A[j]=A[j-1];
A[j-1]=tampung;


}
}

printf("\n\nSetelah sorting : \n");
for (i=0;i<5;i++){
printf("%i ",A[j]);
}
getch();
return 0;
}



insertion sort
#include "stdio.h"
#include "iostream.h"
#include "conio.h"

int main(){

int A[5]={3,4,1,2,8},i,j,tampung;

printf("Sebelum sorting : \n");
for (i=0;i<5;i++){
printf("%i ",A[i]);
}

for (i=1;i<5;i++){
tampung=A[i];
j=i-1;

while (A[j]>tampung && j>0){
A[j+1] = A[j];
j--;
}
A[j+1]=tampung;
}

printf("\n\nSetelah sorting : \n");
for (i=0;i<5;i++){
printf("%i ",A[i]);
}
getch();
return 0;
}

selection sort
#include "stdio.h"

void main(){

int A[5]={3,4,1,2,8},i,j,tampung,pos;

printf("Sebelum sorting : \n");
for (i=0;i<5;i++){
printf("%i ",A[i]);
}

for (i=0;i<5-1;i++){
pos=i;
for(j=i+1;j<5;j++){
if (A[j] pos=j;
}
}
if (pos != i){
tampung=A[pos];
A[pos]=A[i];
A[i]=tampung;
}
}

printf("\n\nSetelah sorting : \n");
for (i=0;i<5;i++){
printf("%i ",A[i]);
}
}

Tidak ada komentar:

Posting Komentar