Consider the following function, which recursively splits a list into equal length sublists (the length of the list is assumed to be a power of the second argument):
repPartition[list_, n_]:= If[Length[list]<=n, list, repPartition[Partition[list, n], n]]
This function does what it is intended to do. However the recursion probably doesn't make this the fastest possible; also I have the feeling that I've probably missed a built-in function which allows me to do this directly.
Therefore my question: Can this definition be improved?