Searching and Sorting Algorithms

Bubble Sort

A Sorting Algorithm that passes over the list many times, compares each pair of adjacent items and swaps them if they are in the wrong order.

Selection Sort

An algorithm which passes over the list, finds the smallest item and moves it to the left, then repeats the exercise for the remaining list until it is all sorted.

Quick Sort

In this sorting algorithm, a pivot is chosen, and all the elements moved either side of the pivot. This is repeated with another pivot either side, recursively until done.

Merge Sort

A sorting algorithm that sorts partial lists then merges them together.

Sorting Algorithm

A process commonly used to sort data

Ascending

Rising, going from smallest to largest

Descending

Falling, going from largest to smallest

List

A set of data that can be sorted into order

Array

A variable that can hold list items

Iteration

A code construct, also known as a loop.

for

a Python keyword that starts a loop

if

a Python keyword that makes a selection

Selection

A code construct that makes a choice between two or more outcomes

Search Algorithm

A structured process that finds a target in a set of data.

Linear Search

A search algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data.

Binary Search

A search algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted.

a[n]

Python code that represents the nth member of an array called a.

Variable

A named value in a computer program that can be changed by the program code as it runs. "temp" and "num" are examples in our bubble sort program.

Target

The item we are searching for in a search algorithm.

Pivot

Used in Quick Sort, items are compared to this element, and placed one side or the other.

Insertion Sort

Removes one element from unsorted data and puts it where it belongs in sorted list. Repeats until no input elements remain.