He should contact the teacher for assistance
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: B. hummer
Explanation:
Given the array :
Given the arra
("explorer", "testa", "hummer", "corvette", "civic", "mustang")
Array indexing usually begins from 0
That is ; the first element in the array is indexed as being in position 0
Using the given array as an example :
Index ____ element
0 ______ explorer
1 _______ tester
2 _______hummer
3 _______ corvette
4 _______ civic
5 _______ mustang
Hence, element in index 2 of the array is hummer
Answer:
l = []
while True:
no = int(input())
if no>0:
l.append(no)
else:
break
print(1)
If this helped consider marking this answer as brainliest. Have a good day.
