On the other hand, a plain English prose description is usually not a good idea either. Good intuition is the product of experience, not its replacement.
The whole point of this course is to develop computational techniques that can be used in any programming language.
This young man probably had a bright future and stood to contribute to the hacker community but for a brief lapse of judgment. Running time The most common way of ranking different algorithms for the same problem is by how fast they run. Dictating the song over a telegraph using Morse code might take a full minute per verse.
This is obviously a function of the input value n, but it also depends on how quickly you can sing. Ideally, we want the fastest possible algorithm for our problem.
Many of the algorithms we will discuss in this course will require extra work to prove correct. When you see a problem for the first time, how should you attack it?
In his paper that gives the law its name, the statistician Stephen Stigler claimed that this law was first proposed by sociologist Robert K. Correctness proofs almost always involve induction.