Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int cariBagiDua(int A[], int p, int bil){
- int s=0;
- int e=p-1;
- int indeks = (s+e)/2;
- //Algoritma Bagi Dua
- //Apakah Ketemu? Jika Ketemu Berakhir
- while ((A[indeks]!=bil) && (s !=e)){
- //Perikas Ke Kanan atau Ke Kiri
- if (bil > A[indeks]){
- //Ke Kiri
- e=indeks;
- }else{
- //Ke Kanan
- s=indeks;
- }
- indeks=(s+e)/2;
- }
- //Pengujian Terakhir
- if(A[indeks] !=bil){
- indeks = -1;
- }
- return indeks;
- }
- int main(){
- const int PanjangLarik=11;
- int A[PanjangLarik]={99,87,76,68,55,46,38,27,18,15,9};
- int bil, indeks;
- cout << "Cari Indeks Dari = "; cin >> bil;
- indeks = cariBagiDua (A,PanjangLarik,bil);
- cout << "Ada di Indeks Ke "<< indeks << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement