61 lines
1.7 KiB
C++
61 lines
1.7 KiB
C++
#include <iostream>
|
|
#include <vector>
|
|
#include <random>
|
|
#include <algorithm>
|
|
#include <chrono>
|
|
using namespace std;
|
|
|
|
// =============================================
|
|
// KONFIGURASI — ubah nilai di sini
|
|
// =============================================
|
|
const int DATA_SIZE = 1000000; // jumlah elemen
|
|
|
|
// Pilih kondisi: "avg", "best", atau "worst"
|
|
const string CASE = "best";
|
|
// =============================================
|
|
|
|
void selectionSort(vector<int>& a) {
|
|
int n = a.size();
|
|
for (int i = 0; i < n - 1; i++) {
|
|
int m = i;
|
|
for (int j = i + 1; j < n; j++) if (a[j] < a[m]) m = j;
|
|
if (m != i) swap(a[i], a[m]);
|
|
}
|
|
}
|
|
|
|
vector<int> generateData(int n, const string& caseType) {
|
|
vector<int> data(n);
|
|
|
|
if (caseType == "best") {
|
|
// Best case: sudah terurut ascending
|
|
for (int i = 0; i < n; i++) data[i] = i + 1;
|
|
|
|
} else if (caseType == "worst") {
|
|
// Worst case: urutan terbalik (descending)
|
|
for (int i = 0; i < n; i++) data[i] = n - i;
|
|
|
|
} else {
|
|
// Average case: acak (random shuffle)
|
|
for (int i = 0; i < n; i++) data[i] = i + 1;
|
|
mt19937 rng(42);
|
|
shuffle(data.begin(), data.end(), rng);
|
|
}
|
|
|
|
return data;
|
|
}
|
|
|
|
int main() {
|
|
vector<int> data = generateData(DATA_SIZE, CASE);
|
|
|
|
auto start = chrono::high_resolution_clock::now();
|
|
selectionSort(data);
|
|
auto end = chrono::high_resolution_clock::now();
|
|
|
|
double ms = chrono::duration<double, milli>(end - start).count();
|
|
|
|
cout << "Case : " << CASE << endl;
|
|
cout << "Size : " << DATA_SIZE << endl;
|
|
cout << "Waktu : " << ms << " ms" << endl;
|
|
|
|
return 0;
|
|
} |