Homework #2
Well today in my data structures and algorithms course we were given our second homework assignment. The assignment is to compare the execution times of a program that uses a TreeSet for one data structure and a HashSet for the other. As well all should expect the hashset should be a lot faster then the treeset, but the goal of the homework is to show by how much.
My problem is that neither versions of the .Net Framework (1.0 or 1.1) implement a treeset or hashset. Actually the framework to my understanding doesn't even implement a Set class or interface, nor do they have a true hashtable, but instead a hashmap. Also why in the heck did they put the TreeNodeCollection inside of the System.Windows.Forms namespace? I guess some things just baffle me, hopefully some of these things will be added to version 2.0 of the framework.
As for now I guess my homework will just take a little more time, because I will have to implement my own versions of these classes.