Decision 1:: Algorithms

Andrew.Blackett@UTCSouthDurham.org

Last modified: 11th July 2020

Decision 1 Overview

1:: Algorithms 2:: Graphs and networks

Sorting and bin What is a graph and how they 3:: Algorithms on graphs
packing. represent things. What algorithms do I need to
be able to apply?
4:: Route inspection
5:: The Travelling Salesman
Find the shortest route 6:: Linear Programming
Find the shortest route
which travels along all How to find an optimal
which visits all places.
roads solution graphically

7:: The simplex algorithm

8:: Critical path analysis
How to find an optimal
solution algebraically. How to plan a project.
What is an algorithm?
An algorithm is a specific set of instructions for carrying out a procedure or solving a
problem, usually with the requirement that the procedure terminate at some point.
Specific algorithms sometimes also go by the name method, procedure,
or technique. The word "algorithm" is a distortion of al-Khwārizmī, a Persian
mathematician who wrote an influential treatise about algebraic methods. The
process of applying an algorithm to an input to obtain an output is called
a computation.

Algorithms you have used…

Algorithms you use every day…
• Long multiplication
• Google page ranking
• Polynomial division
• Sat. nav. shortest distance calculations
• Finding prime factors
• Social Media directing you to things you
• Dividing fractions
might be interested in

Algorithms you will learn on this course…

Sorting Prim’s Simplex*

Bin packing Dijkstra’s
Kruskal’s Floyd’s* *A2 only
1.1 Using and understanding algorithms
Algorithms can be written in code, flowcharts, or just a list of instructions.
Python code

now = datetime.now()
mm = str(now.month)
dd = str(now.day)
yyyy = str(now.year)
hour = str(now.hour)
mi = str(now.minute)
ss = str(now.second)
print mm + "/" + dd + "/" + yyyy + "
" + hour + ":" + mi + ":" + ss

What is this programme doing?

How to eat cake

1) Buy cake
2) Eat cake
1.1 Examples of algorithms
The ‘peasant’ algorithm on two numbers is as follows:
Make a table with two columns, A and B.

1) Write A and B
2) Let A = half A (ignoring remainders), Let B = double B.
3) Write A and B.
4) Repeat step 2 & 3 until A = 1.
5) Delete all the rows where A is even
6) Find the sum of the non deleted Bs, let this equal p.
7) Write p = ….

What does the peasant algorithm do?

Further reading… http://mathforum.org/dr.math/faq/faq.peasant.html

1.1 Example 1

The ‘happy’ algorithm is:

Write down any integer (easiest to use less than 20)
Square its digits and find the sum of the squares
Continue with this number
Repeat this cycle until the number becomes 1 (‘happy’ number) or until
you get trapped in a cycle (‘unhappy’ number).

Show that 70 is ‘happy’.

72 + 02 = 49 12 + 02 = 1
42 + 92 = 97 70 is happy
? ?
92 + 72 = 130
12 + 32 + 02 = 10

Can you find all 5 happy numbers under 20?

1.1 Example 2 – using a trace table
Reveal
Implement this algorithm:
1. Let n = 1, A = 1, B = 1 Step n A B C Write
down
2. Write down A and B
1-2 1 1 1 1, 1
3. Let C = A + B 3-4 2 2
5-6 2 1 2
4. Write down C 3-4 3 3
5-6 3 2 3
5. Let n = n + 1, A = B, B = C 3-4 5 5
5-6 4 3 5
6. If n < 5 go to step 3 3-4 8 11
5 5 5 8
7. If n = 5 stop
7 - stop

It is best to only go onto the next

row when you have to, and leaving
cells empty rather than repeating
values but the MS says… “condone
repeated values in all columns or a
single value in each row” so just do it
however you like, so long as it is
clear.
Test Your Understanding Reveal

A B C D
2 3 0 0
2 3
4 6
6

Print 6

?
Exercise 1A
Pearson Decision 1, Page 5
1.2 Flow Charts

There are three shapes of boxes which are used in the examination:

Start/End Instruction Decision

The boxes in a flowchart are linked by arrows.

As with an algorithm written in words, you need to follow each step in order.
Example 4

Implement this algorithm using a trace table.

Start

n E Decision
Let n = 0
0
Let n = n + 1
1 2 No
Let E = 2n 2 4 No

Print E
3 6 No
4 8 No
Is No
n > 9?
5 10 No
Yes 6 12 No
Stop
7 14 No
8 16 No
9 18 No
10 20 Yes
Example 5
This flowchart can be used to find roots of an equation of
the form 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 0.

Demonstrate this algorithm for the following equations.

𝑎) 6𝑥 2 − 5𝑥 − 11 = 0 a)
𝑏) 𝑥 2 − 6𝑥 + 9 = 0
𝒂 𝒃 𝒄 𝒅 𝒅<𝟎 𝒅=𝟎
𝑐) 4𝑥 2 + 3𝑥 + 8 = 0

6 -5 -11 289 No No

11
Roots are 𝑥1 ?
= , 𝑥2 = −1
6
b)
𝒂 𝒃 𝒄 𝒅 𝒅<𝟎 𝒅=𝟎

1 -6 9 0 No Yes

c)
? 𝑥=3
Equal roots

𝒂𝒂 𝒃𝒃 𝒄𝒄 𝒅𝒅 𝒅𝒅 <
< 𝟎𝟎 𝒅𝒅== 𝟎𝟎

4 3 8 -119 yes

No real roots?
Test your understanding – The Euclidian algorithm
Input various values for A=16 and B=12, use a trace table to show
your results and work out what the Euclidian Algorithm is doing.

step 𝑨 𝑩 𝑩=𝟎 𝑨>𝑩

1-3 16 12 no Yes

6 4

2-5 8 no no

2-5 4 no no

2-5 0 no no

2 yes

Print 4 ?

It is finding the?HCF of A and B

Test Your Understanding
The diagram describes an algorithm in the form of a flow
chart, where a is a positive integer. List P, which is referred
Reveal
to in the flow chart, comprises the prime numbers 2, 3, 5,
7, 11, 13, 17,

(b) Explain the significance of the output list.

(c) Write down the final value of c for any initial value of a. ?
One more to do at home
?
Exercise 1B
Pearson Decision 1, Page 9, Q2, Q5
1.3 Bubble Sort - Motivation
We may want to put a list of values in ascending order, whether
numerically or alphabetically.

[“cat”, “bus”, “abacus”, “fish”]

 [“abacus”, “bus”, “cat”, “fish”]

Applications:

1 It enables us to use a binary search There are many different

if finding an item in the list. well-known sorting
algorithms. We will look at
2 We can find all the values within a bubble sort, and Quick Sort
range. but there are other
algorithms.
3 We can easily find the median and
quartiles of numerical data. Some are more efficient
than others!

4 Common for outputted data to be

sorted, e.g. students in a class list
are sorted by surname.
Bubble Sort
We look at each pair of values in turn, and swap them if they’re in
the incorrect order:

Click to
31 19 55 42 2 112 67 Animate

This is known as ‘one pass’ of the algorithm.

Clearly we’re not done, but we definitely know one value will be in the correct place.
Which?
The last value (112), because it’s guaranteed
? to be moved right on each comparison.
We can then do a ‘second pass’, and can exclude the last value, given
we know it’s now in the correct position:

19 31 42 55 2 67 112 Click to
Animate

After the second pass, we know that the 67 is now in the right place. We keep doing
passes, ignoring one extra item at the end each time.
We can stop if there are no swaps
? on a pass.
Analysis of Bubble Sort
! Bubble Sort Exam Tip: Bubble
Sort should not be
1. On each pass, look at each pair of terms left-to-right, confused with a
swapping if in the wrong order. ‘Bubble Snort’,
which should be
2. Keep doing further passes, ignoring one extra value at the avoided at all costs.
end each time.
3. We are done if there are no swaps on a pass.

Pros Cons

• Simple to implement. • Extremely inefficient. We

• Efficient way to check if list need 𝑛 − 1 + 𝑛 − 2 +
𝑛 𝑛−1
is in order, as if list of size ⋯+ 3 + 2 + 1 = 2
𝑛, only 𝑛 − 1 comparisons comparisons. Since this is a
needed ? ?
quadratic expression, we Fun Fact: The
say bubble sort takes is of algorithm is called
quadratic order ‘bubble sort’
because the
greatest value
‘bubbles up’ to
the end of the list
on each pass.
What should we write in exams?

How to write in an exam:

• Some questions ask you to do one pass ‘giving the state of the list after each exchange’.
• Most questions ask for ‘the state of the list after each pass’ so you don’t have to show
every comparison.
• You must conclude by stating ‘no further changes – sort complete’

Fun Fact - Mark

schemes allow you
to sort from left to
right or right to
? left.

No further changes – sort complete

Test your understanding

Use a bubble sort to arrange these letters into alphabetical order, showing
the state of the list after each pass.

A L G O R I T H M
1st pass A G L O I? R H M T
2nd pass A G L I O? H M R T
3rd pass A G I L H? M O R T
4th pass A G I H L? M O R T
5th pass A G H I L? M O R T
6th pass A G H I L? M O R T
Test your understanding – past exam question

?
Grumpy examiner’s report – is he talking about you?
Further test your understanding

?
Bubble sort - quiz
1. Which number is definitely in its correct position at the end of the
first pass if sorting a list into ascending order?
The largest number is in the correct position if sorting left to right. If
? will be in the correct position.
sorting right to left, the smallest number
2. How does the number of comparisons required change as the pass
number increases?

? comparison than the last.

Answer: Each pass requires one fewer
3. How does the algorithm “know” when the list is sorted?

Answer: When a pass with no exchanges

? occurs.
4. What is the maximum number of comparisons required for a list of
10 numbers, and does it always need this many?

Answer: 9 comparisons in the first pass, then 8, 7, 6, 5, 4, 3, 2, 1 so total

? if the list is already in order.
45, no it could only need 9 comparisons
Exercise 1C
Pearson Decision 1, Page 12-13
1.4 Quick Sort

Animated visualization of the

quicksort algorithm. The
horizontal lines are pivot values

Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and
partitioning the other elements into two sub-arrays, according to whether they are less than or greater
than the pivot. The sub-arrays are then sorted recursively. This can be done in-place, requiring small
additional amounts of memory to perform the sorting.

https://en.wikipedia.org/wiki/Quicksort
Quick sort algorithm
You select a pivot and then split the items into two sub-lists – those less than the pivot
and those greater than the pivot:

1. Choose the item at the mid-point of the list to be the first pivot (if there an even
number of items, choose right of the middle – choosing left is also ok)
2. Write down all the items that are less than the pivot, keeping their order, in a sub-list
3. Write down the pivot
4. Write down the remaining items (those greater than the pivot) in a sub list
5. Apply steps 1 to 4 to each sub-list
6. When all items have been chosen as pivots, stop

The number of pivots has the potential to double at each pass.

There is 1 pivot at the first pass, there could be 2 at the 2nd, 4 at
the 3rd and so on.
Example
1. Choose the item at the
mid-point of the list to be
21 24 42 29 23 13 8 39 38 the first pivot (if there an
even number of items,
choose right of the middle
21 13 8 23 24 42 29 39 38 – choosing left is also ok)
2. Write down all the items
8 13 21 23 24 29 42 39 38 that are less than the
pivot, keeping their order,
in a sub-list
8 13 21 23 24 29 38 39 42 3. Write down the pivot
4. Write down the
8 13 21 23 24 29 38 39 42 remaining items (those
greater than the pivot) in a
sub list
Every number has been chosen as a pivot, so the list is in order.
5. Apply steps 1 to 4 to
each sub-list
6. When all items have
been chosen as pivots,
stop
Further Examples – past exam questions
https://youtu.be/dFpIHcFV0lM?t=27

18 20 11 7 17 15 14 21 23 16 9

The list of numbers shown above is to be sorted into ascending order. Apply
quick sort to obtain the sorted list. You must make your pivots clear.
Test your understanding
Test your understanding
Challenge time!

Challenge 1 – can you arrange the numbers 1-7 in non

ascending order, so every item has been chosen as a pivot after
3 passes.
3 2 1 4 7 6 5

Challenge 2 – can you arrange the numbers 1-7, so every item has
been chosen as a pivot after 7 passes.

7 5 3 1 2 4 6
Exercise 1D
Pearson Decision 1, Page 15, Q2,5,6
1.5 Bin Packing
In the bin packing problem, items of different volumes must be packed into a finite
number of bins or containers each of a fixed given volume in a way that minimizes the
number of bins used. In computational complexity theory, it is a combinatorial NP-
hard problem. The decision problem (deciding if items will fit into a specified number of
bins) is NP-complete.
There are many variations of this problem, such as 2D packing, linear packing, packing by
weight, packing by cost, and so on. They have many applications, such as filling up
containers, loading trucks with weight capacity constraints, creating file backups in media
and technology mapping in field-programmable gate array semiconductor chip design.

For your course you need to know how to implement three bin-
packing algorithms.

• First-fit
• First-fit decreasing
• Full-bin
1d pin-backing
3d bin-packing
Lower Bounds
The lower bound:
Nine boxes of fixed cross section have heights, in metres, as follows;
0.3, 0.7, 0.8, 0.8, 1.0, 1.1, 1.1, 1.2, 1.5
They are to be placed into bins with the same fixed cross section and
height 2m. Determine the lower bound for the number of bins
needed.
To find the lower bound.
0.3 + 0.7 + 0.8 + 0.8 + 1.0 + 1.1 + 1.1 + 1.2 + 1.5 = 8.5m
• Sum all the items.
8.5 ÷ 2 = 4.25 bins • Divide by the size of
the bin
So a minimum of 5 bins will be needed.
• Always round up!

At the moment there is no known algorithm that will always give an

optimal solution. There are three bin packing algorithms in common use:
first-fit, first-fit decreasing and full-bin packing.
First-fit algorithm

• Take the items in the order given.

• Place each item in the first available bin that can take it. Start
from bin 1 each time.

Advantage:
It is quick to do.

Disadvantage:
It is not likely to lead to a good solution.
First-fit algorithm - example
Use the first-fit algorithm to pack the following items into bins of size 20 (the
numbers in brackets are the size of the item).
• State the amount of bins used and the amount of wasted space.

A(8) B(7) C(14) D(9) E(6) F(9) G(5) H(15)

I(6) J(7) K(8)
Bin 1: A(8) B(7) G(5)
Bin 2: C(14) E(6)
Bin 3: D(9) F(9)
Bin 4: H(15)
Bin 5: I(6) J(7)
Bin 6: K(8)

This used 6 bins and there are 26 = (2 + 5 + 7 + 12) units of wasted space.
First-fit decreasing algorithm

• Reorder the items so that they are in descending order.

• Apply the first-fit algorithm to the reordered list.

Advantages:
You usually get a fairly good solution.
It is easy to do.

Disadvantage:
You may not get an optimal solution.
First-fit decreasing algorithm - example

Apply the first-fit decreasing algorithm to the data given in example 1.

A(8) B(7) C(14) D(9) E(6) F(9) G(5) H(15) I(6) J(7) K(8)
First – rearrange into decreasing order
H(15) C(14) D(9) F(9) A(8) K(8) B(7) J(7) E(6) I(6) G(5)

Bin 1: H(15) G(5)

Bin 2: C(14) E(6)
Bin 3: D(9) F(9)
Bin 4: A(8) K(8)
Bin 5: B(7) J(7) I(6)

This used 5 bins and there are (2 + 4) =6 units of wasted space.

Full Bin Packing
• Use observations to find combinations of items that will fill a bin. Pack these
items first.
• Any remaining items are packed using the first-fit algorithm.

Advantage:
You usually get a fairly good solution.

Disadvantage:
It is difficult to do, especially when the numbers are plentiful and awkward.
Full Bin Packing - example
A(8) B(7) C(10) D(11) E(13) F(17) G(4) H(6) I(12) J(14) K(9)

The above items are to be packed in bins of size 25.

a) Determine the lower bound for the number of bins
b) Apply the full-bin algorithm
c) is your solution optimal? Give a reason for our answer.
A(8) B(7) C(10) D(11) E(13) F(17) G(4) H(6) I(12) J(14) K(9)

a) Lower bound = (8 + 7 + 10 + 11 + 13 + 17 + 4 + 6 + 12 + 14 + 9) ÷ 25 = 4.44

5 bins are needed.
b) Bin 1: F(17) A(8)
Bin 2: E(13) I(12)
Bin 3: D(11) J(14)
Bin 4: C(10) H(6) K(9)
Bin 5: B(7) G(4)
c) The lower bound is 5 and 5 bins were used, so the solution is optimal.
Exercise 1E
Pearson Decision 1, Page 20,
1.6 Order of an algorithm
• Determine the order of an algorithm.

• Use the order of an algorithm to determine the run time.

Listen in….
Determining the order of an algorithm could lead to you winning $1,000,000. The problem
known as the P vs NP Problem is one of the 7 Millennium Prize Problems, it asks if every
problem has an algorithm which has polynomial order. Worth paying attention this lesson ay?

https://en.wikipedia.org/wiki/P_versus_NP_problem

1 algorithm

Order of an algorithm……
1.6 Order of an algorithm

The order of an algorithm can be described as a function of its size. If an

algorithm has order 𝑓(𝑛) then increasing the size of the problem from 𝑛 to 𝑚
𝑓 𝑚
will increase the run time of the algorithm by a factor of approximately
𝑓 𝑛

• If an algorithm has order n2, what will be the effect of increasing the size of
the problem from 10 to 20?

202
= 4 so the run time will increase by approximately a factor of 4
102

• If an algorithm has order 𝑛3 , what will be the effect of increasing the size of
the problem from 10 to 20?

203
= 8 so the run time will increase by approximately a factor of 8
103
Order of bubble sort algorithm
For the bubble sort, most of the steps are to do with making
comparisons between pairs of numbers.
• If a list has n items the first pass will require (n-1) comparisons.
• The second pass will require (n-2) comparisons.
• In the worst case this process will continue so that (n-3) are needed for the
3rd pass, and so on right down to 1 comparison in the final pass.
• The number of comparisons would then be.
Some quadratic order algorithms
could be much quicker to run
• 1 + 2 + 3 + … + (n-2) + (n-1) than others, if the order of an
algorithm was 100𝑛2 it would
obviously have a longer run time
1 1 2 1 than one with order 0.5𝑛2
• = 𝑛−1 𝑛 = 𝑛 − 𝑛
2 2 2

• Since this is a quadratic expression, the bubble sort has quadratic order.
 Example 17 – determine the order from a flowchart

No

a) Describe what the algorithm does. a) It tests whether or not n is prime.

b) Suggest suitable output text for boxes A and B. b) Box A: Not Prime, Box B: Prime
c) Determine the order of the algorithm.
c) Think about how many loops you would have to do in the worst case scenario. If
n=11, then you have to check a=2, 3, 4 then stop, if n=29 check a=2,3,4,5,6 = 5 loops.
In general the number of loops is the integer part of 𝑛 so the order is 𝑛
Orders you need to look out for

• Linear order – such as checking how many items

in a list are greater than some value 𝑛
• Quadratic order – such as bubble sort
• Cubic Order – such as using a triple nested loop to
find solutions to 𝑥 3 + 𝑦 3 + 𝑧 3 = 42 with
You could try this if
𝑥, 𝑦, 𝑧 𝜖 𝕫. you find you have
time on your hands!
• If the size of a problem is increased by some factor 𝑘 then:
• An algorithm of linear order will take approximately 𝑘 times as
long to complete.
• An algorithm of quadratic order will take approximately 𝑘 2 times
as long to complete.
• An algorithm of cubic order will take approximately 𝑘 3 times as
long to complete.
Example
A given list-searching algorithm has linear order.
To search a list with 500 values, the algorithm takes
approximately 0.036 seconds. Estimate the time taken by
this algorithm to search a list containing 1250 values.
Approach 1 – using a multiplier Approach 2 – GCSE style proportionality

1250 𝑡∝𝑛
= 2.5
500 𝑡 = 𝑘𝑛
0.036 × 2.5 = 0.09
𝑡 = 0.036, 𝑛 = 500
Approximately 0.09 seconds
0.036
= 𝑘 = 0.000072
500

𝑡 = 0.000072𝑛

𝑡 = 0.000072 × 1250 = 0.09𝑠

Example
The bubble sort algorithm has quadratic order.
a) Given that it takes a compute 0.2 seconds to sort a list of 1600 numbers,
estimate the time needed to sort of list of 480,000 numbers.
b) Comment on the suitability of the bubble sort for sorting large data sets.

Approach 1 – using a multiplier Approach 2 – GCSE style proportionality

480,000 𝑡 ∝ 𝑛2
= 300
1600 𝑡 = 𝑘𝑛2
0.2 × 3002 = 18,000
Approximately 18000 seconds 𝑡 = 0.2, 𝑛 = 1600
or 5 hours to sort 480,000
numbers. 0.2 −8
= 𝑘 = 7.8125 × 10
16002
𝑡 = (7.8125 × 10−8 )𝑛2

𝑡 = 7.8125 × 10−8 × 4800002 = 18 000𝑠

Test your understanding – determine the order
The graph below shows the travel times between various towns. The
challenge is to visit each town in the shortest possible travel time.

• Choose a starting vertex and list all possible routes which satisfy the
problem.
• Determine the order of the brute force search.
EABCD, EABDC, EACBD, EACDB, EADBC, EADCB,
EBACD, EBADC, EBCAD, EBCDA, EBDAC, EBDCA,
ECABD, ECADB, ECBAD, ECBDA, ECDAB, ECDBA,
EDABC, EDACB, EDBAC, EDBCA, EDCAB, EDCBA

The weight is not dependant on the starting

vertex, so EABCD, is equal to ABCDE in this
problem, so we can ignore the starting vertex.

As there are (n-1) options for the first edge, (n-2)

for the third and so on the number of possible
tours to check are 𝒏 − 𝟏 ! So the algorithm is
order 𝒏 − 𝟏 !
Test your understanding – calculate the approx. run time
A ranking algorithm is 𝑂 𝑛 , if the algorithm takes
12 seconds to rank 2.5 million objects, estimate how
long it would take to rank 22.5 million objects
Give a reason your answer is only an estimate.
Approach 1 – using a multiplier Approach 2 – GCSE style proportionality

22.5 × 106 𝑡 ∝ √𝑛
=9
2.5 × 106 𝑡 = 𝑘√𝑛
12 × 9 = 36 seconds

𝑡 = 12 𝑛 = 2.5 × 106

12
= 𝑘 = 7.589466 … × 10−3
√2.5 × 106
The exact run time will
depend on the initial 𝑡 = (7.589466 … × 10−3 )√𝑛
ordering of the items.
𝑡 = 7.589466 … × 10−3 × (22.5 × 106 = 36𝑠
Exercise 1F
Pearson Decision 1, Page 24,

Note the Pearson text book doesn’t have many examples

where you have to find the order of the algorithm, so also
work through the following worksheet.
Finding the order – supplementary questions
1)An algorithm tests if a number (n) is prime by dividing it by every integer less than n, and checking if the result is a whole number or decimal. If all
iterations (except dividing by 1) generate a decimal number it concludes the number is prime.
How many iterations are required if n=10?
How many iterations are required if n=100?
Is the algorithm, linear, quadratic or logarithmic?

2)The grid method of multiplication can multiply an n digit, by another n digit number. Consider the number of individual multiplications required for
multiplying 2 such numbers. What is the order of this algorithm?

3)A search algorithm is written to find the closest 3 dimensional integer coordinates to a point in 3 dimensional space.
The algorithm considers every integer coordinates in a 𝑛 × 𝑛 × 𝑛 cube and computes (using Pythagoras) the distance from that coordinate to a known
point.
What is the order of this algorithm?

4) If there are n people in a room who all want to shake hands with each other, what is the expression in terms of n, for the total number of handshakes
required? What is the order of this expression?

5) What does this algorithm achieve?

•Set max to 0.
•For each number x in the list L, compare it to max. If x is larger, set max to x.
What is the order of this algorithm?
6) Here is an example of a maze which has 7, 2-way decision points. Write an algorithm as a
flow chart which will allow someone to find the exit of the maze.
What is the order of your algorithm for
a maze with n 2-way decision points?

7) My pin to unlock my phone is length n digits. A government official is asking Apple to

break into my phone using brute force search. The man from Apple explains that brute
force search is of exponential order but the government official doesn’t understand. Can
you explain to him what the man from Apple means, and why it is a problem?
Finding the order – supplementary answers
1) 𝑛 = 10 needs 8 iterations, 𝑛 = 100 needs 98 iterations, the algorithm is linear.
2) If 𝑛 = 3, then we need 9 different multiplications, we can then see that the
algorithm is 𝑂 𝑛2
3) There are 𝑛 + 1 𝑛 + 1 𝑛 + 1 coordinates to check, so the algorithm is 𝑂(𝑛3 ) or
cubic order.
Note - you could go into more detail and say the order was 𝑛3 + 3 + 3𝑛 + 1, a mark
scheme would accept either.
4) 5 people would be (4 + 3 + 2 + 1) handshakes, which is the 5 − 1 𝑡ℎ triangular
number, in general 𝑛 people would be 𝑛 − 1 𝑡ℎ triangular number of handshakes
1 1
which is 2 𝑛 𝑛 − 1 = 2 𝑛2 − 𝑛 . Which is a quadratic expression.
5) It returns the largest number in a list, or zero if there is no positive numbers. The
algorithm is linear.
6) Your flowchart. The algorithm has 𝑂 2𝑛
7) There are 10 options for the first digit, 10 for the second digit and so on, therefore
if there are 4 digits, there are 104 possible combinations, generalising this, there
are 10𝑛 possible combination which is an exponential function. Exponential
functions grow faster than polynomial functions so the runtime of the algorithm is
going to be very long.