Computing gcse unit 2.1

3 principles of computational thinking

abstraction, decomposition and algorithmic thinking

abstraction

the process of removing unnecessary details

decomposition

the process of breaking something down into smaller, more manageable parts

algorithmic thinking

a way of getting to a solution by identifying the steps needed

input

whatever goes into the program

output

whatever leaves the program

process

things performed by program

structure diagrams

used to decompose problem

trace table

a table to track the values of variables during program execution.

binary search

A search algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.

linear search

A search algorithm that checks each element in a list sequentially until the target value is found or the list ends.

bubble sort

sorting algorithm that swaps each number one by one till everything is in the right order

insertion sort

sorting algorithm that adds to a new list in the right order

merge sort

sorting algorithm that separates into new lists and puts them together in right order