Computational Thinking In Python

Explore an advanced python solution to a calculator challenge, using a try/except inside a forever loop to validate input and print the square and its root with formatted output.

Explore an advanced python factorization solution: implement a function returning the list of divisors (including the number itself) and robust input handling via a forever loop and value error protection.

Learn to generate prime numbers in python by testing numbers for exactly two factors, then append primes to a list and print the results under a thousand.

Improve a slow brute force prime number generator by integrating a timer to measure performance and iteratively optimize the code to generate primes up to ten thousand.

Create a starlit sky by building a function to draw stars with varying side lengths and sizes, randomizing positions, and generating a thousand stars.

This lecture demonstrates a Python approach to capitalizing the first letter of each sentence in a list-based paragraph, using full stops and a reusable function.

Load a text file into a string, convert to lower-case, and split it into words to enable the word counting challenge, then sort by alphabetical order or frequency.

Explore recursion by solving factorials recursively and visually with a turtle spiral, showing how solutions depend on smaller instances and end when the distance reaches one.

Recreate the Koch fractal through recursion using turtle graphics, starting from a straight line and iteratively turning 60, 120, and 60 degrees to build a complex, order-based pattern.

Explore the recursive Koch fractal in python, starting from a straight line, applying bumps and 60-degree turns, with one-third substitutions toward the Koch snowflake.