#include <iostream>
#include <stdlib.h>
using namespace std;
const int jdata=1024*1024;
int data[jdata];
int binarysearch(int cari){
//bool found=false;
int mid;
int bawah=0;
int atas=jdata;
int result=-1;
while(bawah <= atas){
cout << atas << " " << bawah << endl;
mid=int((atas+bawah)/2);
if (data[mid] == cari){
result=mid; break;
}
else if (data[mid]>cari)
atas = mid;
else
bawah = mid;
}
return result;
}
int main() {
data[0]=0;
for (int i=1; i<jdata; i++){
data[i]=data[i-1]+random()%10;
// cout << data[i]<<endl;
}
cout << "data ditemukan pada: " << binarysearch(data[1048575]);
//cout << search(-100);
return 0;
}
Senin, 14 Desember 2015
Cari Nilai Maksimal
Senin, Desember 14, 2015
No comments
Langganan:
Posting Komentar (Atom)
0 komentar:
Posting Komentar