5.7 Analyzing Algorithms Curriculum Page
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.
Answer
Search 1's runtime increased drastically as the number of values increased. When we conducted search 2, the runtime was much faster and stayed close to the same throughout the whole trail. We concluded that search 1 was linear and search 2, binary. Sort 3 is the Merge Sort because the time did not increase dramatically based on the amount of data in the set. In the second experiment, sort one did the worst, increasing drastically every time, concluding its bubble sort. Sort 2 did best throughout the experiment staying close together, concluding that it is bucket sort. Sort 3 was like sort 1 but did not increase as much and so it is merge sort.