Hashtable and Hashmap Performance comparison

[Srikanth Ramu]

Hastable is synchronized and Hashmap is not, hence I guess Hastable will have some performance degradation. However below testing contradicts my understanding.

import java.util.*;
public class Perf
{
   public static void main(String str[])
   {
       long l = System.currentTimeMillis();
       Hashtable h = new Hashtable();
       //HashMap h = new HashMap();
       String s = null;
       for(int i=0; i<100000;i++)
       {
           s = i+"a";
           h.put(s,s);
       }
       System.out.println("Time taken = " +
(System.currentTimeMillis()-l));
   }
}

In the above code Hashtable performs better when compared with Hashmap. Am I missing some thing here.

[Nitesh Kant]

Here is a discussion on this.
Just search the forums before posting a new topic.

[Srikanth Ramu]

Thanks Nitesh for the link I'll look into it and I do search before posting and did not find this post in my search - Just an info.