linear to binary help

[kittycat]

how would i write this code in to binary search ?

#include<iostream>
using namespace std;
int lotteryList[10];
int main()
{
const int LOTTERY = 10;
int nums [LOTTERY] = {13579, 26791, 26792,33445, 55555, 62483, 77777, 79422, 85647, 93121 };

int winningNumber;
cout<<"Enter this week's winning number";
cin>>winningNumber;
for(int i=0;i<10;i++)
{
if(nums[i]==winningNumber)
{
cout<<"One of the tickets is a winner this week."<<endl;
break;
}else if(i==9) cout<<"Not one of the tickets is a winner this week."<<endl;
}
system ("pause");
return 0;
}

[Chervil]

set start = 0 and finish = 9. That is the range of elements in the table that you want to search.
A:
Select the middle item of the list. mid = start+finish /2
If found, you are done.
If start == finish you are done and the item was not found.
If the middle item is is greater than the search item, set finish = mid - 1
else set start = mid + 1
repeat from step A.

[kittycat]

im lost could you please use code it for me.. we havent touched on binary search in class yet

[Chervil]

I described the algorithm. In order to code it, you need to understand what it does. Sorry if i didn't explain it very well.
http://en.wikipedia.org/wiki/Binary_search_algorithm
Or here's a video which explains the concepts.
http://youtu.be/wNVCJj642n4

[kittycat]

Thank You :)