Question: Answer 1 and 2: 1. Find the maximum item. We have an array of numbers and we are looking for the maximum item in the
Answer 1 and 2:
1. Find the maximum item. We have an array of numbers and we are looking for the maximum item in the array. We have some additional information about the content of the array: The numbers are increasing and at some point they started to decrease. For example: 1,3,4,5,8,10,12,15,13,12,9,8,7,5,3,2 (the maximum value is 15) 1,3,4,5,8,10,12,3,2 (the maximum value is 12) Write an algorithm to find the maximum number. Analyze the time complexity. (You should find the most efficient algorithm)
2. We have k sorted arrays, and we know in total there are n elements in these k arrays. Design an algorithm to sort all n items in one single array. What is the time complexity?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
