In my SLOG post for week 5, I put forward a theory that you could add additional parameters to a linked list node that would allow for much quicker index lookup. If in addition to self.next_, you added self.hundred_next which would store the node 100 nodes deeper, you could essentially leap over the list rather Read More …

I decided to take it upon myself to create a Binary Search Tree balancing function. Although there may be a methodology like the delete function where you can just look at a couple nodes at a time, the ripple effects could potentially be unpredictable. And although you may be able to balance the tree a Read More …

In today’s lecture after the test, Joe went over the theory of removing nodes from a binary search tree. There are essentially 3 cases to consider.   The node is a leaf. This case is the most straightforward. All you need to do is remove the parent’s connection to this node.   The node is an Read More …

In CSC165, we started covering code efficiency (big Oh) and I see that two years ago, CSC148 also covered this by now (by virtue of looking at the midterm from then). So it’s pretty obvious that the efficiency of a data search relies not only on the search algorithm itself, but the data structure as Read More …

Today I’m going to talk a bit about Object Oriented Programming (OOP), though I really have little to no programming experience outside of Python as of yet (does HTML count?).   The thing I like about Object Oriented Programming is that, as abstract as the logic loops in code can become, it often remains easy Read More …