-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathInsertionSelectionSort.c
112 lines (110 loc) · 2.12 KB
/
InsertionSelectionSort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <stdio.h>
#include <stdlib.h>
#define MAKS 255
void ins_array(int []);
void insertion_sort(int []);
void selection_sort(int []);
void swap(int *, int *);
void show(int []);
int n, m, c, s;
int main()
{
int bil[MAKS], menu;
printf("Menu\n1. Insertion sort\n2. Selection Sort\n3. Exit\n\n");
do
{
printf("Masukkan menu: ");
scanf("%d", &menu);
fflush(stdin);
if(menu<3)
{
ins_array(bil);
printf("\nSebelum diurutkan: \n");
show(bil);
}
switch(menu)
{
case 1: insertion_sort(bil); break;
case 2: selection_sort(bil); break;
case 3: printf("Bye!!\n"); exit(0); break;
default: printf("Menu salah!\n\n"); break;
}
if(menu<3)
{
printf("Setelah diurutkan: \n");
show(bil);
printf("\nMovement: %d\n", m);
printf("Count : %d\n", c);
if(menu==2)
printf("Swap : %d\n", s);
printf("\n");
}
} while(menu!=3);
return 0;
}
void ins_array(int bil[])
{
int i;
m=0;
c=0;
s=0;
printf("\nMasukkan jumlah bilangan: ");
scanf(" %d", &n);
fflush(stdin);
for(i=0; i<n; i++)
{
printf("Masukkan bilangan %d: ", i+1);
scanf(" %d", &bil[i]);
fflush(stdin);
}
}
void insertion_sort(int x[])
{
int i, j, key;
for(i=1; i<n; i++)
{
key=x[i];
m++;
for(j=i-1; x[j]>key && j>=0; j--)
{
x[j+1]=x[j];
m++;
c++;
}
if(x[i-1]<key)
c++;
x[j+1]=key;
m++;
}
}
void selection_sort(int x[])
{
int i, j, min;
for(i=0; i<n-1; i++)
{
min=i;
for(j=i+1; j<n; j++)
{
if(x[min]>x[j])
min=j;
c++;
}
swap(&x[i], &x[min]);
s++;
m+=3;
}
}
void swap(int *x, int *y)
{
int z;
z=*x;
*x=*y;
*y=z;
}
void show(int x[])
{
int i;
for(i=0; i<n; i++)
printf("%d ", x[i]);
printf("\n");
}