• CSE231 @ MSU.edu
• Project Euler
• MIT Open Courseware
• https://adriann.github.io/programming_problems.html
• more

My own intro exercises:

• print out a calendar that looks something like this, for every month of the year:

          ===== January =====
          Su Mo Tu We Th Fr Sa
                          1  2
           3  4  5  6  7  8  9
          10 11 12 13 14 15 16
          17 18 19 20 21 22 23
          24 25 26 27 28 29 30
          31
  

• print all prime numbers, up to n
  • then optimize it to use the Sieve of Eratosthenes? Or just memoize is_prime(n)?