There are only a handful of algorithms devised for quantum computation. Shor's algorithm is one of the first. It uses quantum superposition to achieve factoring in polynomial time that would usually take exponentially long on a classical computer. My goal is to give an overview of Shor's algorithm so that you can understand the basic idea of his groundbreaking 1995 paper and see why quantum computation is so revolutionary!