Java question
You will find the minimum element from the lists of integers.
Input: [[5,2,31,9],[2,1,6,7,11],[55,1,7,8,9]]
Output: 1. [The minimum among the lists of integers]
1. Implement a program of O(N^k) runtime complexity of the problem. marks 50
2. Implement a program of ~ O(N*logN) runtime complexity of the above same problem and explain how you have achieved. [Hint : Apply the log rule -> sort the list of integers, then compare the first element of each] marks 50
Total 100
You can choose either C#, Python, Java to implement 1 & 2.
Attach the screenshot of your implementation with output and submit at most 3 pages
long *.pdf or *.doc file by Mar-21-21 11PM
You must upload at least 1 file You can upload up to 1 file
SAMPLE ASSIGNMENT
