- Solve Problem A of FIU TC 1 Vjudge(150 points):: By brute force, a better search and the two one step forms ( x x and ceil(n/2) 2).
- Time by instruction estimation (150 points): Run 100x100 matrix multiplication ten times in C++ and Pyhton native and Numpy and estimate the time by instruction in each language. Hints:
- Insertion Sort Simulations (200 points) Reporduce in Colab Insertion Sort Notebook and add code to simulate Insertion Sort on all permutations and generate the distribution and the average number steps in the following (4 cases): number instructions (lines), number of comparisons, number of exchanges and number of questions in the while. For each case make two versions one using Itertools permutations and Matplotlib Histogram . Used the e Java code of the Applets InsertSortTimePlot, InsertSortCompPlot and InsertSortWhileQuestionsPlot