I cannot understand the exact working of Hashtable as the eg is using a small piece of code. You cannot know the exact speed of fetching the data from a small code, array list will also display it at the same speed, the question is how is the speed increased in terms of searching data? I understood that it uses the index to search fast, but what if there is a huge data set, how will hash table operate on a huge data set?
could you send me a link where it is properly explained?
could you send me a link where it is properly explained?