Answer:
The program in Python is as follows:
myList = []
num = int(input())
count = 0
while num>=0:
myList.append(num)
count+=1
num = int(input())
myList.sort()
mid = int((count-1)/2)
print(myList[mid])
Explanation:
This initializes the list
myList = []
This gets the first input
num = int(input())
This initializes count to 0
count = 0
The following is repeated until the user inputs a negative number
while num>=0:
This appends the input number to the list
myList.append(num)
This increments count by 1
count+=1
This gets another input
num = int(input())
This sorts the list
myList.sort()
Assume the number of inputs is odd, the middle element is calculated as
mid = int((count-1)/2)
This prints the middle element
print(myList[mid])
<em>From the complete question. the condition that ends the loop is a negative integer input</em>
Answer:
Explanation:
The following code is written in Python. It creates a method for each one of the questions asked and then tests all three with the same test case which can be seen in the picture attached below.
def alternating_list(lst1, lst2):
lst3 = []
for x in range(len(lst1)):
lst3.append(lst1[x])
try:
lst3.append(lst2[x])
except:
pass
if len(lst2) > len(lst1):
lst3.extend(lst2[len(lst1):])
return lst3
def reverse_alternating(lst1, lst2):
lst3 = []
if len(lst1) == len(lst2):
for x in range(len(lst1) - 1, -1, -1):
lst3.append(lst1[x])
lst3.append(lst2[x])
return lst3
def alternating_list_no_extra(lst1, lst2):
lst3 = []
max = 0
if len(lst1) > len(lst2):
max = len(lst2)
else:
max = len(lst1)
for x in range(max):
lst3.append(lst1[x])
try:
lst3.append(lst2[x])
except:
pass
return lst3
D. Por el uso de tubos de vacio.