In this paper, I explain the Quadratic Sieve, its Multiple Polynomial variation, the Number Field Sieve, and give some worked examples of the afore-mentioned algorithms. Using my own Maple implementation of the Quadratic Sieve, I explore the effect of altering one of the parameters of the Quadratic Sieve algorithm, with respect to both time and success rate.