Answer Posted / shiva charan

1.basically hashtable stores in terms of (key,value) pair.
2.all the searching operations can be done in O(1) time
complexity.
3. hashtable when u insert the values internally it uses
some optimized algorithm so that accessing will be pretty
much easier.
all the searching operations will be done with less time
complexity if u store the data in a hash table

What is difference between function and method in c#?

907

---

Is a games console a computer?

936

---

Can you mark static constructor with access modifiers?

984

---

What is difference between string and stringbuilder in c#?

963

---

What is the Signification of the "new " keyword in C#? example

949

---

windows c# using datagridview in edit form sql server

4099

---

What is option parameter in C#?

976

---

Is hashset ordered c#?

970

---

Which technology is best for desktop application?

867

---

Are structs faster than classes?

945

---

Is c++ or c# better?

966

---

Why delegates are type safe in c#?

898

---

What are variables in c#?

967

---

Can you store strings in arrays?

978

---

Is Multiple-inheritance supported by c#?

993

---