Question :
(a) One of the most common sorting techniques we have in programming is the ‘Bubble Sort'. This technique will be used to sort an array of elements in ascending order.
Write down the sample code which will rearrange a list of numbers stored in an array in ascending order using the Bubble Sort.
(b) (i) What do you meant by ‘linear search'? Illustrate with a simple algorithm of your own.
(ii) Describe how the ‘binary search' differs from the ‘linear search'? Use a simple algorithm of the binary search to illustrate your answer.
(c) (i) Describe the FIFO structure of the queue.
(ii) Describe how you would implement the queue data structure in its simplest form. Illustrate your answer fully with the necessary sample code.