Algorithms
Here you will find big long lists of algorithms for the sections of the CFOP method. I have taken care to choose algorithms that I think are easy to both memorise and perform, and I have arranged them in an order that I think facilitates learning. While I have also endeavoured to ensure they are error free, if you do spot any mistakes you can leave a comment below or send me an email.
F2L
If you've read the How to be better at F2L section of my speedcubing guide, you'll know exactly how I feel about relying on this table instead of intuition. I have presented them anyway so you can see optimal solutions to all the F2L cases.
1. Basic cases
R U R'
F' U' F
U R U' R'
U' F' U F
2. Corner and edge in top
(U' R U') (R' U R) U R'
(U F' U) (F U' F') U' F
(U' R U) (R' U R) U R'
(U F' U') (F U' F') U' F
d (R' U2 R) d' (R U R')
U' (R U2 R') d (R' U' R)
(R U' R' U) d (R' U' R)
(F' U F U') d' (F U F')
(U F' U2 F) (U F' U2 F)
(U' R U2 R') (U' R U2 R')
(U F' U' F) (U F' U2 F)
(U' R U R') (U' R U2 R')
3. Corner pointing up, edge in top
(R U2 R' U') (R U R')
(F' U2 F U) (F' U' F)
(U R U2 R') (U R U' R')
(U' F' U2 F) (U' F' U F)
U2 (R U R' U) (R U' R')
U2 (F' U' F U') (F' U F)
(R U R' U') U' (R U R' U') (R U R')
y' (R' U' R U) U (R' U' R U) (R' U' R)
4. Corner in top, edge in middle
(U F' U F) (U F' U2 F)
(U' R U' R') (U' R U2 R')
(U F' U' F) (d' F U F')
(U' R U R') (d R' U' R)
(R U' R') (d R' U R)
(R U R' U') (R U R' U') (R U R')
5. Corner in bottom, edge in top
(U R U' R') (U' F' U F)
(U' F' U F) (U R U' R')
(F' U F) (U' F' U F)
(R U' R') (U R U' R')
(R U R') (U' R U R')
(F' U' F) (U F' U' F)
6. Corner in bottom, edge in middle
(R U' R' U) R U2 R' (U R U' R')
(R U' R' U') (R U R' U') (R U2 R')
(R U R' U') (R U' R') U d (R' U' R)
(R U' R') d (R' U' R U') (R' U' R)
(R U' R' d R' U2 R) (U R' U2 R)
OLL
The OLL algorithms here are numbered using the accepted order found on the speedsolving.com wiki (and elsewhere online), so you can always find an alternative to a specific algorithm should you wish. I have chosen these ones because they heavily use three different triggers, which I feel allows for easier memorisation. Simply learn the three triggers, and you nearly know most of the algorithms already. For the algorithms that don't use these triggers, I have bracketed them to show how I might perform them in sections.
You can sort this list by shape, trigger, and number order, to facilitate easy finding of a specific situation and memorising of the whole list.
PLL
Much like the OLL algorithms, these PLL algorithms are presented with their accepted names. These are often referred to as permutations or perms, e.g. H-perm or Nb-perm.
Edges only
H(M2 U M2) U2 (M2 U M2)
ZR' U' R2 U (R U R' U') R U R U' R U' R' U2
UaR2 U' (R' U' R) U R U (R U' R)
Ub(R' U R' U') R' U' (R' U R) U R2
Corners only
Aax z' R2 U2 (R' D' R) U2 (R' D R') z x'
Abx R2 D2 (R U R') D2 (R U' R) x'
ER2 U R' U' y (R U R' U') (R U R' U') (R U R') y' (R U' R2')
Edges and corners
T(R U R' U') R' F R2 U' R' U' R U R' F'
Y(F R U' R') U' (R U R' F') (R U R' U') (R' F R F')
FU' (R' U R U') R2 (F' U' F U) x (R U R' U') R2 x'
V(R' U R' U') y (R' D R' D') R2 y' (R' B' R B R)
JaL' U' L F (L' U' L U) L F' L2 U L U
JbR U R' F' (R U R' U') R' F R2 U' R' U'
Ra(L U2 L') U2 L F' (L' U' L U) L F L2 U
Rb(R' U2 R) U2 R' F (R U R' U') R' F' R2 U'
Na(R U R' U) (R U R' F') (R U R' U') R' F R2 U' R' U2 (R U' R')
Nb(R' U R U') R' (F' U' F) (R U R' F) R' F' (R U' R)
Gay R2' u (R' U R' U') (R u' R2) y' (R' U R)
Gb(R' U' R) y R2 u (R' U R U') (R u' R2)
Gcy R2' u' R U' (R U R' u) R2 y (R U' R')
Gdy2 (R U R') y' (R2 u' R) U' (R' U R') u R2