Step7. Last layer.
7-1 Corners on Last Layer.

I can orient and position corners as same as 3x3x3 (Guus Razoux Schultz's method).

(i) and (iii) are minimum algorythms required.

i)R'DLD'RDL'D'

ii)LDBD'B'L'

iii)R'D'RD'R'D2R

7-2 Edges on Last Layer.

7-2-1 One edge pair

At least one edge pair exist. Solve this pair and another one edge using same method as 3x3x3.

(if you know Guus Razoux Schultz's method, you can use all algorythms.)

7-2-2 Rest of edges

After 3edges positioned, 5 edges remain. So another 2 algorythms can solve all of rest.

These are representative algorythm.

Basically, all algorythms are derived from the same algorythm.

i)F'-uL'u'RuLu'R'-F

ii)F'-RuL'u'R'uLu'-F (reverse of i))

iii)b-D2f'U2fD2f'U2f-b'
   I usually regrip R=front, U=Left, F=Down, u'-R2d'L2dR2d'L2d-u.

iv)b-f'U2bD2b'U2bD2-f (reverse of iii)
   I usually regrip L=front, U=Left, B=Down, u'-d'L2dR2d'L2dR2-u.

v)(F'f')-d'L'dR'd'LdR-(Ff) (corrected. Thanks Koryu.)

7-2-3 Swaping two edge pairs.

Until I knew Chris's algorithm, I solved this using long alg.

Now I solve, r2D2r2(d2D2)r2d2.

7-2-4 Last edges problem.

This algorythm is the basis to fix the problem.

r'D2r'D2r'D2r'D2r'-F2lB2l'F2lB2l'

Inner cubes on D move like the figure.

This movement allows swapping edges.

ex. If you understand, the inner cube movement.

You can solve another situations.

i) (r2R2)(b2B2)(r2R2)............

ii) R'B'....................