Inserting into an Array that Is Indirectly Ordered

Problem:

Write a method that inserts into an array that is indirectly ordered.

Output:

Not applicable.

Solution:

void insert(int x) {
int i=0;
while (k[i] != 0 && a[k[i]] < x) {
i = k[i];
}
a[free] = x;
k[free] = k[i];
k[i] = free++;
}