OPTION 1: data structure (sub menu)
1) computing
2) Stack
3) Queue
4) Binary search
5) Back to main menu
im finished with all the options except for the number 4, the binary search.. can someone help me?
if(b==4)
{
binary:
char bina;
int data[]={32,16,34,1,87,13,7,18,14,19,23,24,41,5,53};
class tree;
cout<<"Accept another?(y/n)";
cin>>bina;
system("cls");
if(bina=='y' || bina=='Y')
{goto binary;}
if(bina=='n' || bina=='N')
{goto DataStructure;
}
}
this is the code that i used for the binary search, is it wrong?