Embedded Files
5.7 Analyzing Algorithms Curriculum Page
Portfolio Reflection Questions:
- 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.
Conclusions for first graph and table:
- Search 1 is linear search and search 2 is binary. I came upon these results because based on the graph results of the experiment and the table, the rate of search 1 is much larger when there in an increase in N than the rate of search 2. When testing 9000 numbers, search 1 takes 202 times longer than the second search algorithm. In other words, it takes longer for search 1 to find the results than search 2.
Conclusions for second graph and table:
- The first sort is bubble sort, the second sort is bucket sort, and the third sort is merge sort. I came upon these results based on the graph results of the experiment. The first sort is bubble sort because it takes the longest since it compares each pair of adjacent items and swaps them so they are in the correct order. (The first sort is exponential and has the longest runtime). The second sort took the least amount of time compared to the other sorts. (By the end of the experiment it has the shortest runtime). Bucket sort is efficient and doesn't take much time because it sorts each "bucket" of cards individually using a sorting algorithm. As for the third sort, its runtime is in the middle so it is merge sort. Merge sort is also very efficient, but takes more time than bucket sort because the items are divided into equal halves and then combined so they are sorted.
Google Sites
Report abuse