we can use the binary search algorithm for this problem because this search

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

Question Posted / pritam

Answer Posted / pritam

we can use the binary search algorithm for this problem because this searching algorithm has O(log n) performance in both worse and average case.

Is This Answer Correct ?

3 Yes

7 No

Please Help Members By Posting Answers For Below Questions

Does treemap sort automatically?

927

What is priority queue in data structure?

1020

What is the need of sorting?

899

Differentiate null and void?

851

why boundary tag representation is used?

906

What is the difference between list and arraylist?

920

What is perfect binary tree?

827

What is sorting explain?

897

Why is hashmap faster than arraylist?

1000

Define an algorithm. What are the properties of an algorithm?

1048

Is hashmap synchronized?

979

What is sequential mapping in data structure?

930

Discuss how to implement queue using stack.

956

Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?

952

What are the advantages of merge sort?

829