2.1 Algorithms STARTED

A sequence that checks every item in a list 1 by 1 until it finds the desired item.

A sequence that finds the desired item of a list according to the midpoints.

It scraps the midpoint and the data to its left and checks again.

It scraps the midpoint and the data to its right.

Bubble sort makes multiple passes through a list. It compares items and changes those that are out of order. Each pass through the list places the next largest value in its proper place.

Compares 1st 2 items and swaps them if necessary.

A full cycle of swapping (doesn’t mean list is sorted).

A more efficient version of bubble sort. Each pass would insert each number into its correct place.

Compares 1st 2 items and inserts the necessary item into its complete correct position rather than swapping them. Has 2 lists, unsorted and sorted.

A small data set or where data is mostly sorted. E.g. a pack of cards.

An efficient sequence that divides an unsorted list into sublists with 1 item each and merges the lists together until it has a complete sorted list.

Use of computers to solve problems.

Representing “real world” problems in a computer using variables and symbols and removing unnecessary elements from the problem.

Breaking down a large problems into smaller sub-problems.

Identifying the steps involved in solving a problem.

Describes the thought processes involved in understanding problems and formulating solutions in such a way that they can be carried out by computers

Reduces a problem into sub-problems or components. These smaller parts are easier to understand and solve

Divide-and-conquer

Identifies essential elements that must be included in the computer models of real-life situations and discards the inessential ones

Generalisation

selection and iteration

reused

one you have solved in the past

carry out similar functions in a new program