# 32.1 Introduction

These notes are some notes on randomized algorithms. These are a really cool set of algorithms, and are best appreciated by reading Probability and Computing (it’s a great book). Here, I have reproduced alternative variations of proofs from other sources, or explain other people’s proofs in greater detail, with more motivating examples.