Nopal CPP
Anonymous
5 x views • 2 months ago
#include <iostream>
using namespace std;
int main() {
// NIM dipecah menjadi array
int nim[] = {8, 8, 0, 3, 2, 0, 2, 5, 0, 0, 9};
int n = 11;
// Bubble Sort (Ascending)
for(int i = 0; i < n-1; i++) {
for(int j = 0; j < n-i-1; j++) {
if(nim[j] > nim[j+1]) {
int temp = nim[j];
nim[j] = nim[j+1];
nim[j+1] = temp;
}
}
}
// Output hasil sorting
cout << "Hasil Sorting (Ascending): ";
for(int i = 0; i < n; i++) {
cout << nim[i] << " ";
}
cout << endl;
// Menentukan prioritas ancaman (nilai terbesar)
cout << "Prioritas Ancaman Tertinggi: " << nim[n-1] << endl;
cout << "Prioritas Ancaman Tinggi: " << nim[n-2] << endl;
cout << "Prioritas Ancaman Sedang: " << nim[n-3] << endl;
return 0;
}