5.07 Analyzing Algorithms

5.7 Analyzing Algorithms Curriculum Page

Analyzing Algorithms: https://docs.google.com/document/d/1TVmDbcqVtT06KywBsoHZruGDComr4Ua4Z60IabWjwt8/edit?usp=sharing

Spreadsheet of Search and Sort Algorithm Analysis Results: https://docs.google.com/spreadsheets/d/1yKtBi1iLKtCENnj8gs_fnrjep_9dFmX7cni3QU9S4CQ/edit?usp=sharing

1. Present the results and the analysis you did for each of the experiments in this lesson, -- i.e., the table of running times you observed, the graphs you created, and the conclusions you reached regarding the searching algorithms and sorting algorithms. Provide a clear description, referring to your graphs and your tabulated data, to explain how you arrived at your conclusions.

The link to the spreadsheet with all tables and results is listed above. In the first experiment, you could tell that the first algorithm was linear because it took much longer than the second algorithm as the lists got longer. For the sorting algorithms, it was clear that the first algorithm was the bubble sort and the other two were merge sort (the fastest) and bucket sort.