Linked List Performance While the Linked List is performant in operations such as insertion, addition, and removal of nodes, it is much more inefficient at retrieving data. inthis is ...

Testing Ad Hoc Testing Very simple testing could work by having a function that tests if the output of our function is equivalent to the expected result we provide outselves. However, this tes...

Testing If we write a function to test the output of a unit of our code to a pre-determined output, that is called a unit test. Ex: Sorting function for an array of strings. public class ...

Lecture We notice that adding to the back of an SLList is much slower than adding to the front. We must traverse through the entire list. We must change our data structure s...

Arrays Like classes, arrays are also sequences of memory boxes. However Classes have named memory boxes (mapped variable names to memory). Class boxes can store different types....

Lecture Beauracracy Although the IntList is a functional list, we can improve it by hiding some of the abstraction object. We will make it so that someone with no recursion would kno...

Lecture To build a list that can grow infinitely large, we must use recursion. Bits Computers stores information in memory as sequence of ones and zeros. When variables are declared in Ja...

The Problem With SLList The AddLast procedure that we have for an SLList is much too slow. The entire list must be traversed before an element is inserted at the end. We cou...

Rewriting IntList We may rewrite the IntList data structure to make it easier to use. For starters, we may add abstraction by creating an IntNode for each element in the list. public class I...

Static Vs. Non-Static Methods An object is an instance of any class. Each class may have instance variables that are unique to each instance object, or static variables that are common to the ...