Header <algorithm> menyediakan fungsi algoritma komputasi siap pakai yang bekerja berdampingan dengan container STL melalui perantara iterator.
Poin Kunci Materi:
std::sort: Algoritma IntroSort (kombinasi QuickSort, HeapSort, dan InsertionSort) dengan kompleksitas terjamin O(n log n).std::binary_search: Mencari keberadaan elemen pada koleksi yang sudah terurut dalam waktu logaritmik O(log n).std::reverse & std::count: Membalikkan susunan data dan menghitung frekuensi kemunculan nilai tertentu.
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<style>
body {
font-family: 'Fira Code', Consolas, Monaco, monospace;
background: #0f172a;
color: #f8fafc;
padding: 20px;
margin: 0;
line-height: 1.6;
}
.header {
background: #1e293b;
padding: 10px 16px;
border-radius: 8px 8px 0 0;
border-bottom: 2px solid #334155;
display: flex;
align-items: center;
gap: 8px;
font-size: 13px;
color: #94a3b8;
}
.dot { width: 12px; height: 12px; border-radius: 50%; display: inline-block; }
.dot-red { background: #ef4444; }
.dot-yellow { background: #eab308; }
.dot-green { background: #22c55e; }
.code-box {
background: #1e293b;
padding: 18px 20px;
border-bottom: 1px dashed #334155;
color: #38bdf8;
font-size: 14px;
white-space: pre-wrap;
}
.comment { color: #64748b; font-style: italic; }
.output-box {
background: #020617;
padding: 18px 20px;
border-radius: 0 0 8px 8px;
color: #e2e8f0;
font-size: 13px;
}
</style>
</head>
<body>
<div class="header">
<span class="dot dot-red"></span>
<span class="dot dot-yellow"></span>
<span class="dot dot-green"></span>
<span style="margin-left: 8px; font-weight: bold; color: #38bdf8;">⚙️ C++ Algorithms - Skillance C++20</span>
</div>
<div class="code-box">
<span class="comment">// Skrip C++20 - Skillance Academy Indonesia</span>
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::vector<int> data = {45, 12, 89, 33, 27};
// 1. Mengurutkan Data (Quick/Intro Sort)
std::sort(data.begin(), data.end());
std::cout << "Data Terurut: ";
for (int n : data) std::cout << n << " ";
// 2. Binary Search Cepat O(log n)
bool ditemukan = std::binary_search(data.begin(), data.end(), 33);
std::cout << "\nAngka 33 ditemukan? " << (ditemukan ? "YA" : "TIDAK") << "\n";
// 3. Membalikkan Urutan
std::reverse(data.begin(), data.end());
std::cout << "Data Dibalik: ";
for (int n : data) std::cout << n << " ";
std::cout << std::endl;
return 0;
}
</div>
<div class="output-box">
<div style="color: #64748b; margin-bottom: 6px;">[Terminal Output] > g++ -std=c++20 main.cpp -o main && ./main</div>
<div style="color: #4ade80; font-weight: bold;">Data Terurut: 12 27 33 45 89 <br>Angka 33 ditemukan? YA<br>Data Dibalik: 89 45 33 27 12</div>
</div>
</body>
</html>
Coba Sendiri (Try it Yourself) »