Topics that will be covered in this project:

$$ Searching

$$ Sorting

$$ Pointers

$$ Dynamic Memory Allocation

Your program should do the following:

$1)$ Ask the user to enter the name an input txt file. You can assume the format

of the submitted file will be valid and should accept any file of the valid format

described in later slides.

$2)$ Read the input txt file and store the list of words into a dynamic array.

$3)$ Sort the array using any sorting method we covered in class.

$4)$ Ask the user to enter an integer less than or equal to the length of the

largest word in the list to select the word length.

$5)$ Search the array using any searching method we covered in class for a

random word of that length.

$5$a$)$ Find all words in the dynamic array of the same length as the user$-$inputted

integer. Store them in a separate container of your choice.

$5$b$)$ Randomly select a word of that length.

$6)$ Use that word to emulate an unlimited$-$rounds game of Bird.

$7)$ Your program must clean up any allocated memory upon game end.

Your game of Bird should do the following:

$1)$ Display how many rounds have been played

$2)$ Show the list of guessed letters not found in the word$-$to$-$guess.

Display no letters if there have been no guesses yet.

$3)$ Show the state of the word$-$to$-$guess using colored letters and blanks

$5)$ Ask the user to input a guess of N length, N being the length of the

word$-$to$-$guess.

$6)$ Prevent the user from inputting an incorrect word length for the

word$-$to$-$guess using input validation.

$7)$ End the game once the user guesses the word correctly.

$8)$ Display the number of guesses upon a correct input.

What is Bird?

$$ Bird is a word guessing game where you present a word length to

guess and then guess words of that length.

$$ Each time you guess, information about your guess is revealed.

$$ Letters that have not been guessed correctly are marked as $.$

$$ Letters that are in the word to guess in the wrong spot are marked X$.$

$$ Letters that are in the word to guess in the right spot are marked O$.$

$$ Letters not in the word are listed for the player$$s reminder.

$$ The game is over when the player guesses the word in the least

number of guesses.

At the start of the game, display the word$-$to$-$guess as a series

of blanks of the same number as the word$-$to$-$guess length,

separated by spaces like so:

$\_\_\_\_\_$

$$ Above would be an example of a five$-$letter word$-$to$-$guess.

When the user inputs a guess...

$\_\_\_\_\_$

$$ L U F F Y

$...$on the next round the console will be displayed with the

following conditions shown on the next slide.