Here is the test 2

hws so far

HW1
count ops of insertion sort
traverse, count ops, forward traversal, backwards traversal through singly linked list

HW2

5n - 8
n^4 + 3
15log n + 80

prove they are O of ....

Welcome!

today in class we do intros, who am i, who are you, what is a data structure, say howdy to a few data structures, how you all know java, but still a little bit of review.

Here is a link to the class website.