You will find the minimum element from the lists of integers.
Output: 0. [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
You can choose either C#, Python, Java to implement 1 & 2.
20 pekerja bebas membida secara purata $22 untuk pekerjaan ini
I, Jignesh Lakhani completed masters from IIT Roorkee, I have very good knowledge of C, C++, data structures, and algorithms. I can complete your work in deadline. feel free to contact me thank you
Hi, My solution will be based on java. Please see my previous projects done in Java. I'm expert in Java and can help you in this area. Hope to hearing from you. Regards, Ramin.
Hello, I have 3 years of experience in problem solving. This is a classical problem which can be imemented quickly. Just contact me for further discussion. Regards.