It is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

(a)  

It iterates the input elements by growing the sorted array at each iteration.

(a)  

It is a kind of sorting wherein it repeatedly finding the minimum element from unsorted part and putting it at the beginning.

(a)  

What is the missing syntax in the example code below?

int (a)   = array [j];