Pregled posta

binarnoPret1

#include
#include
using namespace std;

int binary(int p[], int n, int elt);

int main()
{const int vel=7;
int p[vel]={1,4,5,7,9,12,14};
int elt, odg;

do
{cout<<"\n\nKoji element trazis: ";
cin>>elt;
int poz=binary(p, vel, elt);
if (poz==-1)
cout<<"Trazeni element nije pronadjen...\n";
else
cout<<"Pozicija trazenog elementa je "< cout<<"\n\nZa kraj unesite 0, a za novu pretragu 1...\n";
cin>>odg;
}
while (odg!=0);
return 0;
}
int binary(int p[], int n, int elt)
{
int beg=0, mid, end=n-1;
while (beg<=end)
{mid=(beg+end)/2;
if (p[mid]==elt)
break;
else if (elt end=mid-1;
else
beg=mid+1;
}
if (p[mid]==elt)
return mid;
else
return -1;
}


Post je objavljen 03.04.2013. u 00:32 sati.