Hi - I see the OOL/PLL last layer algs. Is there an alternative algorithm set where you perm/orientate edges in alg 1 then perm/orientate corners in alg 2? Or does this turn out to be a bad choice in reality?
It's barely okay for FMC, but pretty bad for speedsolving. You might want to look into
LLEF and
L4C. Most of the LLEF algs are quite fast/short, and the L4C algs are okay on average (most cases can be solved with one or two fast commutator algs). If I remember correctly, the average move count is a bit lower than OLL and PLL too.
However, LLEF's recognition is pretty awful. You cannot reliably determine the edge permutation just from looking at the edge stickers on three faces (top face + two adjacent sides); you'll have to either look at four faces, or also look at the corners. (Why do you have to look at the
corner stickers to determine
edge permutation? That's because the eight visible corner stickers always have enough information for you to determine the permutation parity, but the
eight six visible edge stickers don't always. The parities of the edge pieces and of the corner pieces are always the same, so knowing one tells you the other.)
(L4C recognition is the same as ZBLL/ZZLL recognition, except with fewer cases so it's a bit easier. Mostly the same thing, and it's not too bad once you practise it enough.)
LLEF+L4C is also very bad on big cubes, where you have to deal with PLL parity. If you solve the edges early and you find that you have PLL parity, you end up having to swap opposite edges, then fixing the edges again, then finally solving L4C for real. (Side note: This is a problem that also afflicts many beginner last layer methods that solve the edges in multiple steps, then solve the corners in multiple steps.)