/* This program is a simple guessing game that uses a binary search function to find your number from an array of random numbers. 1. Enter a number. - The possible random numbers will be from 0--yourNumber. 2. Enter another number. - This number is your guess! written by: bornToCode() */ #include #include #include using namespace std; int binarySearch(int ar[], int n, int key) { int top = 0, bottom = n, middle, prev; for(;;) { middle = (top+bottom)/2; if(middle == prev) break; if(key == ar[middle]) return middle; (key < ar[middle]) ? bottom = middle : top = middle; prev = middle; } return 0; } void shellSort(int ar[], int n) { int gap = n/2; bool swaps = 1; while(gap) { do { swaps = 0; for(int i = 0; i < n - gap; i++) { if(ar[i] > ar[i + gap]) { swap(ar[i], ar[i + gap]), swaps = 1; } } }while(swaps); gap /= 2; } } void print(int ar[], int n) { cout << "\n" << "{ " ; for(int i = 0; i < n; i++) { cout << ar[i]; (i == n - 1) ? cout << " }" << "\n" : cout << ", "; if(i % 10 == 0 && i) cout << "\n\t"; } } int main() { srand(time(0)); cout << "\nHow many numbers would you like to guess from?" << endl; int N; cin >> N; cout << N << endl; int ar[N]; int num; for(int i = 0; i < N; i++) { num = rand() % (N + 1); ar[i] = num; } //cout << "Your list of numbers: "; //print(ar, N); shellSort(ar, N); //cout << "Your sorted list of numbers: "; //print(ar, N); cout << "Guess a number: \n"; int guess; cin >> guess; cout << guess << endl; int found = binarySearch(ar, N, guess); (ar[found] == guess) ? cout << "You win!\n" : cout << "Better luck next time!"; cout << "\nYour numbers: \n"; print(ar,N); return 0; }

Guess_a_Number_(binary_search)