Unformatted text preview: ask user for another probe. repeatedly: if the probe is found in array of words, break. if not found, ask user for another probe. repeatedly: count how many letters from probe are in the secret word. if the probe is the secret word, return the number of probes entered. increase count of probes by one. main: fill the wordlist array. ask user how many rounds they want to play. if the number of rounds entered is not positive, output an error message. repeatedly: print out the round number. generate a random number. tell the user how many letters are in secret word. tell user in how many guesses they got the secret word in. compute the: average. minimum. maximum. print out all the above scores....
View Full Document
- Spring '08
- Letter case, lower case letters, Lower case, Project 5—Computer Science, secret word in.