Sorting and Efficiency

    The past two weeks, most of the stuff we have learned in lectures is about Sorting and Efficiency. We learned various sorting algorithms, their code, efficiency, and when they are most and least productive.

Regex Everything

    Last week's assignment required me to write the longest set of 4 functions that I ever had to write. It also required a ton a of recursion, and a lot of logic.

Binary Trees

    Binary trees are in a weird spot for me. I understand them very well, but I do not understand exercise 3, part b.

Regular Expressions

    This week, an assignment on the creation of valid regular expressions was due. Truthfully, the assignment was very easy. The hardest part of the assignment required understanding of the syntax that was used.

Required Post: Recursion

    If I could describe recursive code in one sentence, it would be this: repeat the function over and over again, until it does what you want it to do. If I was to describe the degree of understanding it took to wrap my head around that concept, I would consider it high.

Tower of Anne Hoy, Complete!

   The solution for the Tower of Anne Hoy took me forever to figure out. In the end, I never solved the fastest solution, but I solved it! It required a hard coding of moving the first 4 cheeses to the second stools, then doing a regular 3 cheese Tower of Hanoi solution with the remaining stools.

Classes, Methods, Functions, Subclasses, Visualizers... Oh My

    During this week, I started on Assignment 1. This asks the student to create a series of object oriented functions to manipulate pieces of cheese on stools in the form of a game.