7 array
7
LAPORAN PRAKTIKUM
Pemrograman Terstruktur
Praktikum 7: array
Nama :Muhammad Aira Sandi
NIM : 24022012
PROGRAM STUDI D3 TEKNOLOGI INFORMASI
POLITEKNIK SEMEN INDONESIA GRESIK
2025
1. Coding
#include <iostream>
using namespace std;
int main() {
int numbers[10];
cout << "Masukkan 10 bilangan bulat:\n";
for(int i = 0; i < 10; i++) {
cout << "Bilangan ke-" << i+1 << ": ";
cin >> numbers[i];
}
cout << "\na) Item pertama: " << numbers[0] << endl;
cout << " Item kelima: " << numbers[4] << endl;
cout << " Item kesepuluh: " << numbers[9] << endl;
int sum = 0;
for(int i = 0; i < 10; i++) {
sum += numbers[i];
}
cout << "\nb) Jumlah semua item: " << sum << endl;
cout << "\nc) Angka dalam urutan terbalik: ";
for(int i = 9; i >= 0; i--) {
cout << numbers[i] << " ";
}
cout << endl;
cout << "\nd) Array setelah bilangan negatif diubah menjadi positif: ";
for(int i = 0; i < 10; i++) {
if(numbers[i] < 0) {
numbers[i] = -numbers[i];
}
cout << numbers[i] << " ";
}
cout << endl;
int threshold;
cout << "\ne) Masukkan threshold: ";
cin >> threshold;
cout << " Bilangan kurang dari " << threshold << ": ";
for(int i = 0; i < 10; i++) {
if(numbers[i] < threshold) {
cout << numbers[i] << " ";
}
}
cout << endl;
int index;
cout << "\nf) Masukkan indeks (0-9): ";
cin >> index;
if(index >= 0 && index < 10) {
cout << " Item pada indeks " << index << ": " << numbers[index] << endl;
} else {
cout << " Indeks tidak valid!" << endl;
}
int searchNum;
bool found = false;
cout << "\ng) Masukkan nomor yang dicari: ";
cin >> searchNum;
cout << " Indeks nomor " << searchNum << ": ";
for(int i = 0; i < 10; i++) {
if(numbers[i] == searchNum) {
cout << i << " ";
found = true;
}
}
if(!found) {
cout << "Nomor tidak ditemukan!";
}
cout << endl;
int temp = numbers[0];
for(int i = 0; i < 9; i++) {
numbers[i] = numbers[i+1];
}
numbers[9] = temp;
cout << "\nh) Array setelah memindahkan item pertama ke terakhir: ";
for(int i = 0; i < 10; i++) {
cout << numbers[i] << " ";
}
cout << endl;
return 0;
}
2. Ouput Program
3. Grafik JSP
4. Penjelasan Program
