Introduction

In this section you will get familiar with the homework structure.

Figure $1$: The array and the linked list

Figure $2$: Filling the linked list using the array

Figure $8$: Template codes

About Figure $1$

$1.$ As shown in the Figure $1,$ an array called x array is defined with $101$ random numbers.

$2.$ As shown in the Figure $1,$ a region is initialized as starting with the address $0$x$200000004$ to be used for the linked list.

$3.$ As shown in the Figure $1,$ the region for the linked list is filled by x array.

About Figure $2$

$1.$ As shown in the Figure $2,$ ft lstfill function is used to fill the linked list area using the array.

$2.$ ft lstfill function takes the size parameter s which is iterating through $5,10,15,...,100.$

$3.$ So$,$ each time ft lstfill called with s$,$ first s number of integers in the x array are filled into the linked list to be sorted.

About Figure $3$

$1.$ As shown in the Figure $3,$ as iterated once in the for loop, one can observe the first $5$ integers of x array is sorted using the linked list.

$2.$ As shown in the Figure $3,$ time and time asm are $5.$ Which means ft lstsort is executed $50$us or thereabouts.

$3.$ Since ft lstsort asm is not yet implemented and also not yet called, instead ft lstsort is called, we might obviously expect time and time asm to be the same in each iteration.

About Figure $4$

$1.$ As shown in the Figure $4,$ sorting $10$ numbers takes about $140$us$.$

$1.$ In Figure $8,$ templates for timing asm and ft lstsort asm are provided. You should implement these as detailed below:

$2.$ System Timer

a$.$ You should implement SysTick Start asm for the Systick timer to start sending interrupts to the CPU. Check for the registers as shown in Figure $9$

b$.$ You should implement SysTich Stop asm to stop Systick timer and save ticks value.

c$.$ You should go into timing.c$,$ delete SysTick Handler$$s C implementation, come back to timing asm.s and uncomment ;EXPORT SysTick Handler, and finallyimplement Systick Handler FUNCTION. Thus, you complete timer part.

$3.$ Sorting Algorithm

a$.$ For sorting side of this homework, you should implement a bubble sort algorithm.

$4.$ BigO Analysis

a$.$ And finally, if you go back to Figure $4,$ you will see how to measure time passed for sorting the numbers.

b$.$ You are required to save the measurements for time and time asm for each iteration, and provide them as a graph in your report.