Linear v Binary Search Algorithms

The following is pseudocode for which algorithm?

for each element in array

if element you’re looking for

return true

else

return false

• linear

• binary

• bubble

• merge

The following is pseudocode for which algorithm?

Repeat, starting at the first element:

If the first element is what you’re looking for (the target), stop.

Otherwise, move to the next element.

• linear

• binary

• bubble

• merge

The following is pseudocode for which algorithm?

look at middle of array

if element you’re looking for

return true

else if element is to left

search left half of array

else if element is to right

search right half of array

else

return false

• linear

• binary

• bubble

• merge

Which algorithm must start with an ordered list/array?

• linear

• binary

• bubble

• merge

Which search algorithm does this represent?

• linear

• binary

• bubble

• merge

"Look for lost item" is a(n)

• process

• decision

• terminator

• data item

In computer science, an algorithm must be

• Finite

• Precise

• Well-defined

• Unambiguous

Pseudo-code is written for

• computer to execute

• humans to read

Which algorithm is more likely to run longer in a search of a list of names?

• Linear

• Binary