In previous sorting animations, we animated selection, insertion, and bubble sort. They are slow O(n^2) slow sorting algorithm. Merge Sort, a divide and conquer algorithm, is a much faster sorting
In level 1 project: three tilted squares (https://pythonturtle.academy/three-tilted-squares/), you drew only three tilted squares. Now use a loop to draw 60 evenly spaced out squares.
You created a random letter matrix in a previous project. Write a program that generates a random word search table given a list of words. You will practice list, string