2.3 algorithms

Question 1

2.3.1 algoritms

Answer 1

jfrngjrwr

Question 2

4 standard algorithms

Answer 2

-linear search
-binary search
bubble-sort
-insertion-sort

Question 3

linear search

Answer 3

used on unordered lists . Starts from the first element and compares it to the value u are tying to find. If its a match the index value will be returned. If not the process repeated for the next element…
-suitable for small lists

Question 4

binary search

Answer 4

used on a sorted list. first finds data in the middle if it is a match process stops, if not see if its bigger or smaller then value we are looking for then get rid of the unwanted half (divide and conquer) which creates a sublist. process repeats till there is a match.
-suitable for large lists

Question 5

bubble sort

Answer 5

Start at the beginning and compare the first item with the second. If they are out of order, swap them. Repeat till whole list is in order

Question 6

insertion sort

Answer 6

start at the beginning and check if the value is in the correct position. if it is move on to the next one and if not just insert it into the right position. keep going till you get a sorted list

Question 7

two ways to measure efficiency of algorithms

Answer 7

-time complexity: how much time they need to solve a problem
-space complexity: the amount of memory needed to solve the problem

Question 8

the suitability of different algorithms

Answer 8

-linear search:
small data sets
unordered lists

-binary search:
large data sets
ordered lists