<span>Units ..................................................</span>
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.
Answer:
128 is ur answer
Explanation:
please mark me as brainilist
Is a Microsoft Bing ads certification Exam question.
I think that the correct answer is:
False
Source and more info: <span>https://goo.gl/JUw7Bw</span>
xndnxbxnndndndnndnxndnnxndndnndndndnndndndndndnndnxnx
