how to determine the complexity of an algorithm as log(n)
- 1 Answers
- 3046 Views
- Google, I also Faced
- E-Mail Answers
Answer Posted / karthik
log(n) is depth of binary tree containing n-elements..
so if we split array into two and omit one part and consider
another part... and continue this process.....
in problems like this the complexity will be log(n)..
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
a program that performs some preliminary processing in C, it acts upon certain directives that will affect how the compiler does its work a) compiler b) loader c) directive d) preprocessor
How to establish connection with oracle database software from c language?
hi any body pls give me company name interview conduct "c" language only
One of the Institutes contains 5 student groups. Every group contains 4 students. Institute wants to store student group’s details in array. Group should contain group member’s details (name and registration number and age), project name, and mark of the group.
What is 1f in c?
What is scope rule of function in c?
How can I split up a string into whitespace-separated fields?
What is 1d array in c?
What are compound statements?
How do we declare variables in c?
WRITE A PROGRAM TO MERGE TWO SORTED ARRAY USING MERGE SORT TECHNIQUE..
how to introdu5ce my self in serco
How can variables be characterized?
What does 2n 4c mean?
How to get string length of given string in c?
