Answer:
Hi!
The correct answer is E.
Explanation:
void change(int ar[], int low, inthigh) {
int temp;
if(low< high) { <em>// here ask if the positions low and high of the array are the same.</em>
temp= ar[low]; <em>// first, saves the element on ar[low] in temp.</em>
ar[low]= ar[high]; <em>// second, the element on ar[high] in ar[low]. First switch.</em>
ar[high]= temp; <em>// third, saves the element on temp in ar[high]. Complete switch.</em>
change(ar,low + 1, high - 1); <em>// Recursive call, adding one position to low, and subtracting one position to high. </em><em>Important: </em><em>When low and high have the same value, the recursive call will finish.</em>
}
}
Result: Switch the lower half of elements in the array with the upper half.
Explanation:
heyy
everyone come here for truth and dare
vzg-hqvy-wdn
Record companies lose money because people download songs for free.
Answer:
function sum(number) {
if (number == 1) {
return 1;
}
return number + sum(number -1);
}
Explanation:
This is a recursive function, it means that is a function that calls itself for example: if you call the function with sum(5) the process is :
sum(5)
|______ 5 + sum(4)
|_______ 4 + sum(3)
|______ 3 + sum(2)
|_____2 + sum(1)
|_____ 1
the result is 1+2+3+4+5 = 15
ICloud because it links your old device to the new one
