In Coral Language: Given a sorted list of integers, output the middle integer. Assume the number of integers is always odd. Ex: If the input is 2 3 4 8 11 -1 (a negative indicates end), the output is: 4 The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs". Hint: Use an array of size 9. First read the data into an array. Then, based on the number of items, find the middle item. This is what I have so far but it's coming up as wrong: integer array(9) userNums integer i integer in integer index for i = 0; i < 11; i = i + 1 if i >= 10 Put "Too many inputs" to output i = 10 else in = Get next input if in == -1 index = i i = 10 else userNums[i] = in Put userNums[index/2] to output I have tried playing around with i, putting i > 9, i >= 9, i > 8, i >=8, i > 10, i >= 10, i > 11 and i >= 11, but all of these variations are incorrect.
In Coral Language:
Given a sorted list of integers, output the middle integer. Assume the number of integers is always odd.
Ex: If the input is 2 3 4 8 11 -1 (a negative indicates end), the output is:
4
The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs".
Hint: Use an array of size 9. First read the data into an array. Then, based on the number of items, find the middle item.
This is what I have so far but it's coming up as wrong:
integer array(9) userNums
integer i
integer in
integer index
for i = 0; i < 11; i = i + 1
if i >= 10
Put "Too many inputs" to output
i = 10
else
in = Get next input
if in == -1
index = i
i = 10
else
userNums[i] = in
Put userNums[index/2] to output
I have tried playing around with i, putting i > 9, i >= 9, i > 8, i >=8, i > 10, i >= 10, i > 11 and i >= 11, but all of these variations are incorrect.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
