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
You drew Pascal’s Triangle in a project. Draw 32 rows of Pascal’s Triangle and color the cells that contain numbers. Does it look like Sierpinski Triangle?