An array A$[1$l$..$n$]$ of n distinct integers is called k$-$partitioned if it can be divided into k partitions with n$/$k integers in each partition $($you can always assume that n$/$k is an integer$)$ such that the integers in a partition are always larger than those in an earlier partition and smaller than those in a later partition. The ordering of the integers in a partition does not matter. For example, A $=[4,10,8,19,100,90]$ is $2-$partitioned while A $=[16,15,30,45,70,50]$ is $3-$partitioned.