Compares the efficiency of the hash map implementation with the tree map

  
using System;
using System.Collections;

public class CompareMaps {
  public const int MAX  = 50000000;

  public static String time(IDictionary map) {
    Object value = null;
    long starttime = Environment.TickCount;
    for (int i = 0; i < MAX; i++) {
        value = map[i];
    } 
    long stoptime = Environment.TickCount;
    return value + " took " + (stoptime - starttime);
  }          
  
  public static void Main(String[] args) {
    int SIZE = 1000;
    IDictionary hash = new Hashtable(2*SIZE);
    IDictionary tree = new SortedList();
    
    Random random = new Random();
    int i = random.Next(5000000);
    
    for (int j = 0; j < SIZE; j++) {
       if(!hash.Contains(i))
          hash.Add(i, i);
       if(!tree.Contains(i))
          tree.Add(i, i);
    }
    Console.WriteLine("Hash for {0}", time(hash));
    Console.WriteLine("Tree for {0}", time(tree));
  }
}

Related examples in the same category

1.	Implement GetHashCode method and store it in a hashtable
2.	Add value to Hashtable and loop through the value key pairs
3.	Enumerating a hash table collection
4.	illustrates the use of a Hashtable
5.	illustrates the use of the Hashtable methods
6.	Demonstrate Hashtable
7.	Get IDictionaryEnumerator enumerator from Hashtable
8.	Properties based on Hashtable
9.	DictionaryEntry Structure Defines a dictionary key/value pair that can be set or retrieved.
10.	Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object.
11.	Hashtable.Clear Method removes all elements from the Hashtable.
12.	Hashtable.Contains Method determines whether the Hashtable contains a specific key.
13.	Hashtable.CopyTo Method copies the Hashtable elements to a one-dimensional Array instance at the specified index.
14.	Hashtable.GetEnumerator Method returns an IDictionaryEnumerator that iterates through the Hashtable.
15.	Hashtable.IsSynchronized Property gets a value indicating whether access to the Hashtable is synchronized (thread safe).
16.	Hashtable.Remove Method removes the element with the specified key from the Hashtable.
17.	IComparer Interface exposes a method that compares two objects.

Compares the efficiency of the hash map implementation with the tree map : Hashtable « Collections Data Structure « C# / C Sharp

Related examples in the same category