That's fine if you are willing to require all n parts to be available to reconstruct the key.
In many applications, though, you want to allow a subset of the parts to reconstruct the key. You might want, say, 8 people to have key shares, but want any 3 of them to be able to reconstruct the key. Shamir's makes this kind of setup easy.
I wouldn't call that "splitting". This is how you do shamir's scheme over GF(2^n) when the number shares equals the threshold.
That doesn't have to be true. Rather than splitting an AES key K into substrings, a better approach is to choose n parts such that:
None of the component K_i will reveal any information about K without knowledge of its peer components.