NAMA : RISKA SALSABILA LA JIA

NIM : 123230034

TUGAS2

#include <iostream>

using namespace std;

int sequential_search(int arr[], int size, int x) {

for (int i = 0; i < size; ++i) {

if (arr[i] == x) {

return i;

return -1;

int binary_search(int arr[], int size, int x) {

int low = 0;

int high = size - 1;

while (low <= high) {

int mid = (low + high) / 2;

if (arr[mid] == x) {

return mid;

} else if (arr[mid] < x) {

low = mid + 1;

} else {

high = mid - 1;

}
 }

return -1;

int main() {

int n;

cout << "Masukkan jumlah elemen: ";

cin >> n;

int arr[n];

cout << "Masukkan elemen-elemen: ";

for (int i = 0; i < n; ++i) {

cin >> arr[i];

cout << "Menu:\n";

cout << "1. Sequential Search\n";

cout << "2. Binary Search\n";

int choice;

cout << "Masukkan pilihan (1 atau 2): ";

cin >> choice;

if (choice != 1 && choice != 2) {

cout << "Pilihan tidak valid.\n";

return 1;

int x;

cout << "Masukkan angka yang ingin dicari: ";

 cin >> x;

int index;

if (choice == 1) {

index = sequential_search(arr, n, x);

} else if (choice == 2) {

index = binary_search(arr, n, x);

cout << "Data yang dimasukkan:\n";

for (int i = 0; i < n; ++i) {

cout << arr[i] << " ";

cout << endl;

if (index != -1) {

cout << "Angka ditemukan pada indeks: " << index << endl;

} else {

cout << "Angka tidak ditemukan dalam array.\n";

return 0;