catchup
Mathematical Programming with Python
https://people.sc.fsu.edu/~jburkardt/classes/...
python_2025/catchup/catchup.html

catchup: revisit Eratosthenes's prime calculation. Compute the execution time of a code. Determine if a single number is prime. Read text from a file into a list of lines; into a list of lists of words; into a single list of words.

Lecture notes:

• catchup.pdf

The sieve of Eratosthenes:

• eratosthenes.py
• eratosthenes_timing.py

Is n prime?

• is_prime1.py
• is_prime1_timing.py
• isprime_timing.py

Reading "grook.txt"

• grook.txt
• grook_reader.py
• grook_reader_split.py
• grook_reader_strip.py
• grook_word_list.py

Given a list of words, return a sorted list of the unique words.

• unique_words.py

Given a list of words, count how often each word occurs. (Didn't work so well on Alice in Wonderland.)

• word_frequency.py

Reading Alice in Wonderland, count word frequency.

• alice_in_wonderland.txt
• alice_word_list.py