Comparing the Algorithms (Final 10%)
Search for the following answers. You may use INTELLIGENT copying and pasting providing you give credit to the source website:
Create a new Google Doc called Comparing Algorithms and share it with your teacher.
Question 1: Imagine you are Revenue Canada and need to sort and then eventually search all the Social Insurance Numbers in Canada. Which sort algorithm will work best? Why? Research your answer. Do not guess. You may find that neither is better. If so, explain why.
Question 2: Find out what BIG O NOTATION means when analyzing algorithm efficiency. Then find the BIG O for each of the following algorithms.
Algorithm | Big O Efficiency | Explained (You can copy and paste this answer as long as you sort of, kind of understand what you copy.) |
Linear Search | n/2 | |
Binary Search (iterative) | ||
Binary Search (recursive) | ||
Selection Sort | ||
Bubble Sort | ||
Insertion Sort |
Part 2 40%
Design and conduct a simple experiment to test the speed of these algorithms. If it takes you more than a few minutes to come up with an idea, then skip this section. You will need a LOOOOOONG array. This can be filled with randomized numbers/Strings OR for more realistic test, try searching for a database of city names or movie titles, etc. The website Kaggle.com also has many data sets if you can figure out how to use them.
Then in this doc:
Explain your experiment’s methodology: |
Describe your results for 3 different algorithms: |
Did it the results meet your expectations: |