Internally, how would the key and then the value be retrieved from a hashtable. Are the keys sorted? What sort of big-O would the lookup be?

Curious, how would you go about writing your own custom Hashtable class, without using the build-in c# methods to do this?

is there a way to search a hashtable by value, not by key in c#?

is there a way to search a hashtable by value, not by key in c#?

i have a hashtable of usernames as a key, when a user connects with the same name, i want to add a number to the end. so if "larry" joins, and another joins with the same name i want the new string to be "larry-01". if ...

Hi! A have an associative massive... something like "green" => 5 "red" => 3 "yellow" => 1 "brown" => 4 "orange" => 2 I need to sort it by the second value, i.e.: ...

Hey all, lets say i have a set of items for example 10 items, these items are changed frequently "added or removed and can exceed 10". Beside the add and remove the items are read frequently as well for example after 4-5 read thro ...

How can I convert hashtable(1,a<t>) to list<t> ? Thanks

I have an xml file that looks like: [code] <root> <label key="home">Home</label> <label key="quit">Quit</label> <label key="start">Start</label> </root> ...