The Metropolis-Hastings algorithm is a widely applicable procedure for drawing samples from a specified distribution on a large finite set. The talk will describe the Metropolis-Hastings algorithm and some of its properties. There will be a discussion of some of the applications and an example.