Extended Euclidean Algorithm

[Christopherx]

I couldn't think of anywhere better to put this, and i've come to rely on this forums efficiency. Im trying to get my head around the RSA algorithm, and i'm onto the final step, calculating the private exponent, but I can't seem to work out the extended euclidean algorithm, and how it can be used for finding the modular multiplicative inverse. Can someone, give me a step by step guide on here, how this can be done? I know it's a bit to ask, but i've been hunting for an answer for a while now. Thankyou!