|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.ObjectDriver
public class Driver
| Constructor Summary | |
|---|---|
Driver()
|
|
| Method Summary | |
|---|---|
static void |
balanceBinarySearchTree()
This method will: |
static void |
clearRunTimes()
This method clears the array of run times to all zeros |
static long[] |
getRunTimes()
This method returns the array of run times that was generated by the previous call to runTestCase() |
static java.util.Vector<MyInteger> |
getVectorOfMyIntegers()
This method is used to obtain a Vector<MyInteger> with
131,071 MyInteger objects. |
static void |
main(java.lang.String[] args)
|
static void |
measureHeightOfBinarySearchTree()
This method will: |
static void |
populateBinarySearchTree()
This method will: |
static void |
searchBinarySearchTree()
This method will: |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public Driver()
| Method Detail |
|---|
public static long[] getRunTimes()
runTestCase()
public static void clearRunTimes()
public static java.util.Vector<MyInteger> getVectorOfMyIntegers()
Vector<MyInteger> with
131,071 MyInteger objects.
Vector<MyInteger> with
131,071 MyInteger objects.public static void populateBinarySearchTree()
Instantiate aBinarySearchTreeRepeat 10 Times: Obtain aVector<MyInteger>with 131,071MyIntegerobjects. Measure the run time of inserting all 131,071 elements into theBinarySearchTreeMake theBinarySearchTreeempty
public static void searchBinarySearchTree()
Instantiate aBinarySearchTreeRepeat 10 Times: Obtain aVector<MyInteger>with 131,071MyIntegerobjects. Insert all 131,071 elements into theBinarySearchTreeMeasure the run time of finding all 131,071 elements in theBinarySearchTreeMake theBinarySearchTreeempty
public static void measureHeightOfBinarySearchTree()
Instantiate aBinarySearchTreeRepeat 10 Times: Obtain aVector<MyInteger>with 131,071MyIntegerobjects. Insert all 131,071 elements into theBinarySearchTreeMeasure the run time of calculating the height of theBinarySearchTreeMake theBinarySearchTreeempty
public static void balanceBinarySearchTree()
Instantiate aBinarySearchTreeRepeat 10 Times: Obtain aVector<MyInteger>with 131,071MyIntegerobjects. Insert all 131,071 elements into theBinarySearchTreeMeasure the run time of balancing theBinarySearchTreeMake theBinarySearchTreeempty
public static void main(java.lang.String[] args)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||