Exam 8: Algorithms

We use a _______ search for an ordered list.

We use a _______ search for an unordered list.

_______ is a step-by-step method for solving a problem or doing a task.

_______ is an English-language-like representation of code.

The items are divided into two lists (sorted and unsorted) _____ sort.

In ______ sort, the smallest item moves to the beginning of the unsorted list. There is no one-to-one swapping.

_______ is a basic algorithm that arranges data according to its value.

The _______ construct uses a set of actions one after another.

_______ is a basic algorithm that multiplies a list of numbers.

There are ______ basic constructs in computer -science.

_______ is a basic algorithm that adds a list of numbers.

In _______ sort, the item that goes into the sorted list is always the first item in the unsorted list.

_______ is a pictorial representation of an algorithm.

The _______ construct handles repeated actions.

_______ is a process in which an algorithm calls itself.

The _______construct tests a condition.

_______ is a basic algorithm in which we want to find the location of a target in a list of items.

In _______ sort, the smallest item from the unsorted list is swapped with the item at the beginning of the unsorted list.