-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtanpa-vector.cpp
46 lines (36 loc) · 1.1 KB
/
tanpa-vector.cpp
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
#include <iostream>
#include <algorithm>
struct Sepatu {
std::string merk;
std::string jenis;
int ukuran;
};
void selectionSort(Sepatu* sepatuArray, int n) {
for (int i = 0; i < n - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < n; j++) {
if (sepatuArray[j].ukuran < sepatuArray[minIndex].ukuran) {
minIndex = j;
}
}
std::swap(sepatuArray[i], sepatuArray[minIndex]);
}
}
int main() {
Sepatu sepatuArray[] = {
{"Nike", "Lari", 42},
{"Adidas", "Lari", 40},
{"Puma", "Lari", 41}
};
int n = sizeof(sepatuArray) / sizeof(sepatuArray[0]);
std::cout << "Sebelum pengurutan:" << std::endl;
for (int i = 0; i < n; i++) {
std::cout << "Merk: " << sepatuArray[i].merk << ", Ukuran: " << sepatuArray[i].ukuran << std::endl;
}
selectionSort(sepatuArray, n);
std::cout << "Setelah pengurutan:" << std::endl;
for (int i = 0; i < n; i++) {
std::cout << "Merk: " << sepatuArray[i].merk << ", Ukuran: " << sepatuArray[i].ukuran << std::endl;
}
return 0;
}