CareerCup

It is it a random swap or element next to it?

If the input array contains more than a string starting with 'a', how can you sort with the constraint that we can use only one swap for strings starting with 'a'? Am not I not understanding it clearly? Please explain.

How about this?

for (i = 0; i < N - 1; i++)
   x = minimal number from A[i] to A[N-1];
   swap (a[i], x);
}

This looks to me more like a Selection sort.

"and for sorting you can use only swap"
what does above statement mean? if we can sort without swapping then like using insertion sort...i think with both(bubble/selection sort) , we may need more than one swap for a
like
bacabd

also in selection sort,if we can swap with last minimum then i think it can also work...

bubble sort can be good. since it sorts in descending order. :)