# Can anyone tell me what does this means it will be more feasible if any example is given

Cubesort sorts the contents of an array A containing N items by repeatedly partitioning the array into small groups and sorting within the groups. A total of D different partitions, denoted R,, R,, . . . , R, will be used. For any i where 1 I i I D, any two array locations K and L are in the same group in partition Ri if the binary representations of K and L differ only in bit positions max(G - 2)m, 0) through im - 1 (assuming the least significant bit is in position 0). Note that R, partitions the array into N/M groups of size M, and for all i where 2 I i 5 D, Ri partitions the array into N/M2 groups of size M2. The following definitions and notation will be used to describe Cubesort. If X is a nonnegative integer then the y-bit binary representation of X will be written as X = (Xo,...i), Xo,-2). . . X& and the ith bit of X will be denoted by Xci, (again, the 0th bit is the least significant). A j-cube, where 0 I j I D, is a set of Mj locations in the array A that differ in only th