1. Solve Problem 1-1 -Cormen, Leiserson, Rivest and Stein (3 points) assuming that the algorithm takes f(n)
Upload the Overleaf link in the text box of the UN Moodle assignment as 1. Overleaf link (do not share with emails, see note below)
2. Time by instruction estimation (2 points): Run 100 x 100 random integer matrix multiplication ten times in C++ in https://www.onlinegdb.com/online_c++_compiler and take time using std::chrono, estimate the time by instruction with minimum running time of the then times. assume that the multiplication takes 2n^3 - n^2 ( n=100) instructions and estimate the time of each instruction. Do the same with Java in https://ideone.com/ , and in Pyhton native, Numpy and Fortran in Google Colab, hints:
Upload the C++ and Java codes, the Google Colab link and the list
in the text box of the UN Moodle assignment (do not share with emails, see note below)
Note: Please do not include emails when sharing in Google Colab or Overleaf because it sends annoying email updates, please use the shared link option and upload the link in the UN Moodle assignment if we get any annoying email you will get a reduction of 40% in your grade.