N Queens

1
Lecture 15

• N Queens
• Program complexity if we want to determine which
  of the numbers 1,m are prime, how many
  operations does it save to cut the isPrime loop
  at sqrt(k)?
• Sieve of Eratosthenes
• Tower of Hanoi