binary search A lottery ticket buyer purchases 10 tickets a week. Write a program that initializes an array or a vector with these numbers and then lets the player enter this week’s winning 5-digit number. The program should perform a linear search through the list of the player’s numbers and report whether or not one of the tickets is a winner this week. Here are the numbers:

Complete Question:

A lottery ticket buyer purchases 10 tickets a week, always playing the same 10 5-digit “lucky” combinations. Write a program that initializes an array or a vector with these numbers and then lets the player enter this week’s winning 5-digit number. The program should perform a linear search through the list of the player’s numbers and report whether or not one of the tickets is a winner this week.

Here are the numbers:

13579 , 62483 , 26791 , 77777 , 26792 , 79422 , 33445 , 85647 , 55555 , 93121

#include<iostream>

using namespace std;

int main(){

 bool check = false;

 int num;

 int winningnumber[10] = {13579, 26791, 26792, 33445, 55555,62483, 77777, 79422, 85647, 93121};

 cout<<"Enter Winning Number: ";

 cin>>num;

 for(int i =0;i<10;i++){

 if(winningnumber[i] == num) {

   check = true;

  }

 }

 if(check){

 cout<<"You win";

 }

 else{

 cout<<"You did not win";

 }

return 0;

}

Explanation:

I've added the full program as an attachment where I used comments as explanation

nope i prefer two because it is simpler, i don't like all the powers you get

explanation:

but that's my opinion