Comparison report for Matlab and C++ codes

Writing a report comparing two Matlab codes before and after modifications. The report should start by describing the old Matlab code in details then mention the flaws in it in terms of syntax and language usage. Then suggest improvements that are applied in the new Matlab code and how these improvements were implemented with examples through out the text and mentioning the algorithm that was used to modify the work. Further the optimized Matlab code was migrated to C++ so a comparison between the two languages should be done to show which one is better for the application and how C++ is better in terms of this application. What needs to be done:- The techniques and complexity of the components of the software pseudo-code based count of instructions leading to a complexity analysis The report needs to show at this pseudo-code level how more efficient methods were substituted for less efficient ones. need to be evaluated in comparison to existing methods timing of the newly improved software and the prior software compared in high quality and detail he conclusion needs to be based on the presentation of the implemented algorithm and its evaluation relevant literature review needs to be added A module by module breakdown with inputs and outputs and the operation performed needs to be added. Based on these results, a meaningful conclusion can be added The exact changes that the code was under translating existing code from Matlab to C++ and building a needed matrix library in C++ The actual algorithmic changes that were made to accelerate the code are described the problem being solved is fully defined. Each step of the initial Matlab algorithm should be described, not only in words but with a description of the mathematical operations being implemented All details about how each step of the algorithm was improved must be added At each step, if complexity theory was used to justify a change, what was the original complexity and what is the complexity now? To demonstrate this a series of computations for cases of varying size must be run. The actual reduction of the algorithmic complexity of the code (or parts of the code) can then be measured and empirically demonstrated. When comparing runtimes, it is very important that all details of the problem being solved and the computer used are known. What is the model number of the CPU used in each case? For compiled codes, what compiler was used? What compiler options and optimization settings were chosen? Changing the optimization level of a compiler can easily lead to a factor of 100 speedup in C++.