Unit 5 Vocab #1

problems for which an algorithm can be constructed to answer yes/no for all possible inputs

an approximate solution for a problem that can be found in a reasonable amount of time

input variables for a procedure

problem that cannot be solved in a reasonable or practical amount of time (Polynomial time)

the goal of finding the best solution among many

how well a computer uses time (CPU) and space (memory) resources

A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

• Parallel search

• Multi-search

• Linear search

• Binary search

Answer explanation

a problem for which no algorithm can be constructed that always leads to a yes-or-no answer

solve by trial and error, trying every possible option

Select the best description to explain what a linear search algorithm is.

• Put the elements in order, check each item in turn.
• Put the elements in order, compare with the middle value, split the list in order and repeat.
• Elements do not need to be in order, check each item in turn.
• Elements do not need to be in order, compare to the middle value, split the list in order and repeat