Yes u are right ... here are the details http://msdn.microsoft.com/en-

how to search an element in sorted linked list with time
complexity is O(log n).

Question Posted / sniper

Answer Posted / sniper

Yes u are right ...
here are the details

http://msdn.microsoft.com/en-us/library/ms379573%28v=vs.80%29.aspx#datastructures20_4_topic4

thanks ...

Is This Answer Correct ?

3 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Can you provide some implementation of a dictionary having large number of words?

1044

What are the basic operations of stack?

862

Why do we use dynamic arrays?

807

Why is it called bubble sort?

835

How do you find the height of a binary tree?

833

Parenthesis is never required in postfix or prefix expressions, why?

838

What is default array size?

955

What is heap tree in data structure?

858

What is the difference between length () and size () of arraylist?

842

When new data are to be inserted into a data structure?

868

What are different types of sorting techniques?

870

Why is reflection slower?

856

What is the difference between 1d and 2d array?

906

Define binary tree insertion.

907

What is difference between hashset and linkedhashset?

1031