Question

With basic (do not use #include <algorithm>, etc.) and simple C++

Write a program which reads a text file “input.txt” and stores all the distinct words in an array. A word consists of letters only - uppercase and/or lowercase. An incoming word should be inserted into the array such that it is always in ascending order. Use binary search to ensure that no duplicate words are added. Assume that there are no more than 100 distinct words. Assume that the file is terminated by the flag “@@@@@”.

After the array of words described above has already been loaded, write code to simulate the game of "hangman". The program chooses a word from the array using random numbers. If the word has n letters, the program displays n asterisks to the user. The user then has to input one letter at a time as he attempts to guess the word. If the user guesses a correct letter, the program replaces asterisks with all occurrences of the letter. For example, if the word is apple and the user enters p then the program displays *pp**. If the user then guesses e, the program displays *pp*e. If the user fails to guess the word in 12 attempts the program displays the chosen word and the user is “hanged”. Include in your program the option for the user to quit the game at any time.

You may use #include <iostream>

#include <stdlib.h>

#include <time.h>

#include <fstream>

#include <string.h>

Answer 1

#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <fstream>
#include <string.h>
using namespace std;

void insert(string str_ary[],string word,int* size)
{
if(size==0){ // string array size is 0
str_ary[*size]=word;
(*size)++; // incrementing the array size after inserting
}
else{
int i;
for (i=*size-1; ( i >= 0 && str_ary[i] > word); i--) // find correct position for string to insert
str_ary[i+1] = str_ary[i];

str_ary[i+1] = word;

(*size)++;
}
}

int b_search(string str_ary[],string word,int size)
{
int l=0,r=size-1;
while (l <= r) {
int m = l + (r - l) / 2;

// Check if word is present at mid
if (str_ary[m] == word)
return 1;

// If word greater, ignore left half
if (str_ary[m] < word)
l = m + 1;

// If word is smaller, ignore right half
else
r = m - 1;
}
return 0;
}

bool isPresent(char c_ary[],char c,int size) // to check a character is present in a string
{
for(int i=0;i<=size;i++)
if(c_ary[i] == c)
return true;
return false;
}

int main()
{
ifstream file;
string word,str_array[100];
int size=0;

file.open("input.txt"); // opening file

if (!file.is_open()){
cout<<"File not opened.";
return 0;
}
// extracting words from the file
while (file >> word)
{
if(word == "@@@@@")
break;
// inserting words

if(!b_search(str_array,word,size))
insert(str_array,word,&size);

}

file.close();

// Game of Hangman
int rand_index, i, attempt=0, choice, ci=0;
char c[12];
string word_guess,rand_word;

srand(time(0));
rand_index = rand() % size; // generate random index
rand_word = str_array[rand_index]; // random word

cout<<"Game of Hangman"<<endl;
i=0;

while (rand_word[i] != '\0')
{
cout<<"*"; // displaying *****
i++;
}

while(attempt<12)
{
cout<<endl<<"press 1 to guess a character. "<<endl;
cout<<"press 2 to guess word."<<endl;
cin>>choice;
if(choice==1){
cout<<"Enter guess a character : ";
cin>>c[ci];
i=0;
while(rand_word[i]!= '\0'){
if(isPresent(c,rand_word[i],ci))
cout<<rand_word[i];
else
cout<<"*";
i++;
}
ci++;
}
if(choice==2)
{
cout<<"Enter guess a word : ";
cin>>word_guess;
if(rand_word == word_guess){
cout<<"You guessed correctly.\nYou Win.";
return 0;
}
else
cout<<"You guesses wrong";
}
attempt++;
}
cout<<"You exhausted you all attempts.\nYou lose.";
return 0;
}