Searching algorithms

Question 1

How does a linear search work?

Answer 1

1) check the first value
2) If it is the desired value, stop
3) Otherwise check the second value
4) keep going until all elements have been checked or the value is found

Question 2

How does a binary search work?

Answer 2

1) put the list in order
2) take the middle value
3) compare it to the desired value
a) if it is the desired value, stop
b) If it is larger than the desired value, look at the half of the list to the left of the middle value
c) If it smaller than the desired value, look at the half of the list to the right of the middle value
4) Repeat until you find the desired value

Question 3

What are the pros of a linear search?

Answer 3

it works with unsorted lists
it is not affected by changes to the list
it works well for small lists

Question 4

what are the cons of a linear search?

Answer 4

It is slower
It is inefficient for large lists

Question 5

What are the pros of a binary search?

Answer 5

It is more efficient
It is efficient for large lists

Question 6

What are the cons of a binary search?

Answer 6

It does not work with unsorted lists