REPORT CONTENT $[40$ MARKS$]$:

Introduction: General explanation on what is time and space complexity.

$1.$ Selection Sort

$2.$ Bubble Sort

$3.$ Quick Sort

$4.$ Heap Sort

$5.$ Bucket Sort

Summary: Clarification on the important of time and space complexity for

the algorithms.QUESTION $[$TOTAL: $30$ MARKS$]$

The number of iterations required to execute an algorithm, contingent on the input length, is

known as time complexity. Since operating system, processor power, and programming

language are taken into account, time complexity is not a measure of how long an algorithm

takes to run. The amount of computational complexity known as time complexity refers to the

amount of time needed to complete an algorithm. The amount of time it takes for each statement

to be completed is the algorithm's temporal complexity. It thus heavily depends on the scale of

the processes.

A specific amount of memory space is required when an algorithm is executed on a computer.

The space complexity of a programme indicates how much memory it needs to run. A program's

memory needs for storing temporal values and input data while it is operating result in auxiliary

and input space space complexity.

Based on the above algorithm's picture, student is required to produce ONE $(1)$ report to

discuss the time and space complexity for each of the following sorting algorithms:

Selection Sort

Bubble Sort

Quick Sort

Heap Sort

Bucket Sort

The report must start with the general explanation on what is time and space complexity

followed by the discussion on time and space complexity for the above sorting algorithms. In

your summary, clarify the important of time and space complexity for the algorithms.

Any suitable diagrams $/$ figures can be added into the report contents for each sorting

algorithms. The students also can include the algorithms' steps for each of the sorting.