Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40663 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / lokesh bhatt
o(n)= linear
o(log n)(base 2)= binary
bcz in linear v search one be one while in binary v divide array in two part every time
| Is This Answer Correct ? | 15 Yes | 4 No |
Post New Answer View All Answers
What is a treemap chart?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
How do you sort an arraylist?
Which language is best for data structures and algorithms?
What is time complexity of quick sort?
Differentiate between push and pop?
Why is hashmap faster than treemap?
What are the objectives of studying data structures?
What is a bubble sort and how do you perform it?
Is bucket sort a comparison sort?
What is unmodifiable list?
How do you get placements?
Give one example of right rotation.
What do you mean by double hashing?
In depth questions regarding the data structures and the Databases used in the Projects developed.
