## This is the modulized wheelfortune program ## you need write the following fu

Question

## This is the modulized wheelfortune program
## you need write the following functions

## I have not posted the main function because it is already written

## and when i post it i keep having gay weird A` systems pop up and replace parts of my code

## and i dont know how to fix that, so heres the jist i use .ASM language for Mars or Qtspim

## I need these functions below to be written, if you want me to email you the main code to give you a good look at what I did

## and you think it will help you write these functions better please use a COMMENT not an ANSWERE that contains your email

## address. If you write these functions and they work your 5/5 stars are a 100% gaurentee good luck! MUST WORK Qtspim or ##MARS

## initialize the puzzle display as something liks * **** **********
generate_stars:

## is match function. Return 1 if two given strings are match, return 0 otherwise
is_match:

## return the argument itself if it is NOT a lower case letter
## otherwise, return its upper case
toupper:

## check if the given char is in the phrase and count how many
## there are three arguments: the given char ($a0), the given phrase (address in $a1),
## and the cover of the phrase (address in $a2)
## the cover of the phrase will be change accordingly, i.e. reveal the correctly guessed char
check_char:

## alltoupper
## convert a sentence to all upper case
## assume that the sentence address is stored in $a0
alltoupper

Explanation / Answer

Here's some code that declares three arrays, one statically, one onthe stack, and one on the heap and fills them with 100 numbers,then displays all the 100 numbers. This can be compiled withGCC. Notice the different ways of declaring arrays.#include using namespace std;int main (int argc, char **argv) { static int array[100]; //declare staticarray (not very useful in this context, but useful when doingObject-Oriented Programming) for (int i = 0; i < 100; i++) {

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---