In this chapter’s code alongs, our primary objective is to implement the two nontrivial algorithms that we saw in the main chapter for computing a GCD of two integers and for finding primes. We would then like to time these algorithms to see how much faster they are than simpler approaches. To implement these algorithms, we will need to learn how Go implements functions along with the basics of control flow (if statements, loops, etc.)
First, however, we will need to install Go, along with a text editor that you will use to write code. Follow along to the next lesson to get started with writing your first program!
