Pagini recente » Diferente pentru problema/joc15 intre reviziile 6 si 9 | Circulatie | Monitorul de evaluare | Profil Bogdan2412 | Cod sursa (job #2035215)
#include <fstream>
std::ifstream fin("cautbin.in");
std::ofstream fout("cautbin.out");
int a[1000], n, val;
void ReadArray();
int BinarySearch(int l, int r, int v);
int main()
{
ReadArray();
fout << BinarySearch(0, n - 1, val);
fout.close();
}
int BinarySearch(int l, int r, int v)
{
int m;
while( l <= r)
{
m = (l + r) / 2;
if (v == a[m])
return m;
if(v > a[m])
l = m + 1;
else r = m - 1;
}
return -1;
}
void ReadArray()
{
fin >> n;
for(int i = 0; i < n; ++i)
fin >> a[i];
fin >> val;
fin.close();
}