Answer:
for(i = 0 ; i < NUM_VALS; ++i)
{
cout << courseGrades[i] << " ";
}
cout << endl;
for(i = NUM_VALS-1 ; i >=0 ; --i)
{
cout << courseGrades[i] << " ";
}
cout << endl;
Explanation:
The first loop initializes i with 0, because we have to print the elements in order in which the appear in the array. We print each element, adding a space (" ") character at its end. After the loop ends, we add a new line using endl.
The second loop will print the values in a reverse order, so we initialize it from NUM_VALS-1, (since NUM_VALS = 4, and array indices are 0,1,2,3). We execute the loop till i >= 0, and we print the space character and new line in a similar way we executed in loop1.
Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
<em>Shift </em>selects multiple worksheets at the same time. <em>Ctrl</em> selects all that you selected with Ctrl pressed.
Answer:
0xFF.
Explanation:
The Register A of HSC12 is an 8-bit register.So the maximum value for 8 bit is 8 1's (11111111). So the decimal value for the maximum 8 bits is 255 but all the options given are in hexadecimal so among the given options only 0xFF has the value of 255 in decimal F=(1111)₂.So two F's make 8 bits and their decimal value is 255.