Write a report detailing the following:

$$ The definition of an algorithm

$$ Your definition should refer to the bubble sort example in fig. A below when explaining.

$$ The process involved in building an application

$$ The technical steps involved in the generation of code, from editing through compiling to

execution.

$$ Analysis of the process of writing code, including the potential challenges faced.

$$ An evaluation of the two implementations of the bubble sort algorithm given in appendices A $($Appendix A is attached in screenshot$)$

and B considering aspects such as efficiency of implementation, coding standards and the

relationship between the algorithm $($fig$.$ A$)$ and the code variants.

Fig A:

begin BubbleSort$($array$)$

for all elements of array

if array$[$i$]>$ array$[$i$+1]$

swap$($array$[$i$],$ array$[$i$+1])$

end if

end for

return array

End BubbleSort

Appendice A is attached in screenshot

Appendice B:

L $=[45,67,12,5,30,19,62,28,51,10]$

print$(\text{'}$Original List:$\text{'})$

print$($L$)$

forj inrange$(0,10)$:

fori inrange$(0,9)$:

ifL$[$i$]>$L$[$i$+1]$:

L$[$i$],$ L$[$i$+1]=$ L$[$i$+1],$ L$[$i$]$

print$(\text{'}$

Sorted List:$\text{'})$

print$($L$)$Appendix A

$,,$

F$1$lenane: bubble$\_$sort$\_$functions.py

Author: Bob

Date: $\frac{14}{87}\frac{?}{2822}$

Description: This nodule contains definitions of functions

dedicated to sorting algorithe inplenentations

$,..$

def swap$(a,b)$ :

return $b,a$

def bubb$1$e$\_$sort$($nua$\_11$st$)$: # accepts a $11$st of numbers and sorts then in ascending order

no$\_$of$\_$passes$=1$en$($num$\_$ilst$)$

swapped$-$False

for $1$ in range $(,$ no$\_$of$\_$passes$)$:

for $1$ in range$(,$ no$\_$of passes$-1)$:

If nun$\_1$ist$[1]$ snum $11$st$[1+1]$:

nun$\_11$st$[1],$ num$\_11$st$[1+1]=$swap$($num$\_1$ist$[1],$ num$\_11$st$[1+1])$

siwapped$-$True

If no swapping takes place in one conplete pass,

all values are in order and sorting stops

if swapped$-$mFalse:

return

$,,$

Filenawe: bubble$\_$sort$\_$appondixA$-$py

Author: Bob

Date: $\frac{14}{?}$ e$7/2$e$22$

Description: testbed file for sorting algorithes exercise

$,.$

fron bubble$\_$sort$\_$functions $1$nport $*$

def main$()$ :

$11$ st $=[45,67,12,5,39,19,62,28,51,18]$

print$(\text{'}$Or$1$ginal List:"$)$

print$(11$st$)$

bubble$\_$sort$(11$st$)$

print$(\text{'}$

Sorted List:"$)$

print$(11$st$)$

$ma1n()$