Given an array a[ ] of size (n) with the elements located in a[0], a[2], ., a[n-1]:

for (i =1; i < n; i++) {

v = a[i];

j = i;

while(j > 0 && a[j-1] > v) {

a[j] = a[j-1]; j--;

}

a[j] = v;

}

What is the algorithm of the above code segment?