2.1 Algorithms

Process of removing unnecessary details and including only the relevant details

Breaking a complex problem into smaller more manageable parts

Creating a step by step solution to a problem

Binary and Linear search

Simple The list doesn’t need to be ordered Easy to program

Not efficient Takes time with a lot of data

More efficient than a linear search

Only works on an ordered list

Checks each item in the list one by one until it finds what it is looking for

Finds the middle item in an ordered list By doing n+1/2 Compares the item to the middle item So it knows where to look in the first half of the second half Repeats until the item is found

Sorts items into an ordered list

Checks the first 2 items in a list Swaps them if they are in the wrong order Moves to the next items and Repeats Moves through the entire list again Until ordered

Finds the middle item by (n+1)/2 Splits the list in half Repeats until items are paired Each time the sub-list are paired They are sorted into the correct order

Looks at 2nd item in the list and compares it to the items that are in front of it Then inserts it into the right place correctly It is Quick for sorting small lists

Parallegoram

Diamond

Rectangle

The control passing betweens the connected shapes

Print(“hello”)

For i = 0 to 7 … next i

== Equal to != Not equal to < Less than <= Less than or equal to > Greater than >= Greater than or equal to

2 - Because the MOD function always returns the remainder

2 - DIV functions returns how much a number goes into another number - excluding remainders

If x== 6 then ... elsif .. then .. else ... endif