Sorts an array by its keys (if any). The sorting is an one-step operation (is not time consuming) because in the internal representation of arrays used by Concept, the array keys are already sorted; is a matter of rearranging the elements only (very fast).