Professional Documents
Culture Documents
Oleh :
Dinmas Rizki Kurniawan (2103187085)
Dosen :
Umi Sa'adah, S.Kom., M.Kom.
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#define MAX 100000
int n;
int arr[MAX];
int arrTemp[MAX];
long t1, t2;
int main()
{
printf("MENU SORTING ASCENDING - DESCENDING PERFORMANCE");
menuSorting();
return 0;
}
void menuSorting(){
int pilih;
printf("\n\nBerapa jumlah data? ");
scanf("%d",&n);
srand(time(NULL));
generate(arr);
do{
backup(arr);
puts("\n\nMenu Sorting");
puts("1. Insertion");
puts("2. Selection");
puts("3. Exit");
printf("Pilih : ");
scanf("%d",&pilih);
if(pilih==1){
time(&t1);
insertion(&arr);
time(&t2);
printf("Durasi = %d\n", t2-t1);
} else if(pilih==2){
time(&t1);
selection(&arr);
time(&t2);
printf("Durasi = %d\n", t2-t1);
}
restore(arr);
}while(pilih<3);
}
printf("\nMode Urut\n");
printf("1. Ascending\n");
printf("2. Descending\n");
printf("Pilih : ");
scanf("%d", &ascdesc);
for(i=1;i<n;i++){
key=arr[i];
j=i-1;
if(ascdesc == 1){
while(j>=0 && arr[j]>key){
arr[j+1]=arr[j];
j--;
}
} else {
while(j>=0 && arr[j]<key){
arr[j+1]=arr[j];
j--;
}
}
arr[j+1]=key;
}
}
printf("\nMode Urut\n");
printf("1. Ascending\n");
printf("2. Descending\n");
printf("Pilih : ");
scanf("%d", &ascdesc);
B. Output