2.1 Algorithms - Key Vocabulary Flashcards

Front

Algorithm

Back

An abstracted program which completes a given task, whatever the data provided

Front

Search

Back

Searching is looking through data, making comparisons with a search term, until the algorithm either finds the data, or identifies that it is not present.

Front

Sort

Back

Putting given sets of data into specified order – usually ascending (alphabetical) or descending (reverse alphabetical)

Front

Linear Search

Back

A type of search where the computer checks every variable, in order, until it finds the search term. Potentially very slow.

Front

Binary Search

Back

A search type based on repeatedly halving the searchable data, until the search term is found

Front

Bubble Sort

Back

A method of sorting data which looks at pairs of variables, and swaps them around if out of order. This continues until there are no more swaps to be made.

Front

Merge Sort

Back

Splits the data into increasingly small segments, until single data points are reached, then reassembles the data structure one item at a time.

Front

Insertion Sort

Back

Checks through the data until finding the first incorrectly placed item. The algorithm then checks all the previous places to see where the item fits, and inserts it in that place.

Front

Abstraction

Back

Abstraction is moving a problem out of the specific in order to create a general solution that would work in similar scenarios. Ignoring the gritty details to focus on the problem.

Front

Decomposition

Back

Breaking a problem down into smaller, computational solvable chunks