CS1 Unit Review: Searching and Sorting Algorithms

Front

An ___ can be defined as a step-by-step sequence of instructions to solve a problem

Back

algorithm

Front

The ___-sort algorithm works by repeatedly swapping neighboring numbers in a list if they are out of order, until the whole list is in order.

Back

Bubble

Front

The ___-sort algorithm works by splitting a list in half and separately sorting the two halves.

Back

Merge

Front

The ___-sort algorithm works by repeatedly finding the smallest number in an unsorted list.

Back

Selection

Front

For the binary search algorithm to work, the input list needs to be:

Back

Sorted

Front

Binary search in a sorted list of 7 items: How many items are eliminated if the key is not found in the first check?

Back

4

Front

Given a sorted list and a prize (or "key") to find, which search algorithm would you expect to perform best?

Back

Binary search

Front

Given a very large unsorted list, which algorithm would you expect to sort the list fastest? Options: Merge sort, Linear sort, Bubble sort, Selection sort

Back

Merge sort

Front

What is the time complexity of the bubble sort algorithm?

Back

Front

What is the complexity of the selection sort algorithm?

Back