Unit 6 Code.org

Front

What is a linear search?

Back

A linear search is an algorithm that checks each element in a list sequentially until the desired element is found or the list ends.

Front

When should a linear search be used?

Back

A linear search should be used when the data is unsorted or when the list is small.

Front

What is a binary search?

Back

A binary search is an efficient algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.

Front

When can a binary search be used?

Back

A binary search can only be used on sorted data.

Front

What is a heuristic in problem-solving?

Back

A heuristic is a practical approach to problem-solving that may not guarantee an optimal solution but is sufficient for reaching an immediate goal.

Front

What is an undecidable problem?

Back

An undecidable problem is a problem for which no algorithm can be constructed that always leads to a correct yes-or-no answer.

Front

What is the purpose of algorithms in programming?

Back

Algorithms are step-by-step procedures or formulas for solving problems and performing tasks.

Front

What does it mean for an algorithm to be efficient?

Back

An efficient algorithm is one that uses the least amount of resources, such as time and memory, to solve a problem.

Front

What is the difference between optimal and non-optimal solutions?

Back

An optimal solution is the best possible answer to a problem, while a non-optimal solution is a satisfactory answer that may not be the best.

Front

What is the significance of sorting data before using a binary search?

Back

Sorting data is crucial for binary search because the algorithm relies on the data being in a specific order to function correctly.