What the Painter's algorithm would do would be to show things on top of each other, instead of intersecting.
Another problem is when objects overlap, as in the following picture, when there is no correct drawing order at all.
The limitations, related to the definition of object furthest away, is addressed by the depth-sort algorithm.
Another limitation is the fact that it is a slow algorithm, especially compared to the BSP algorithm.