how to determine the complexity of an algorithm as log(n)
- 1 Answers
- 3404 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 c program to display count values from 0 to 100 and flash each digit for a secong.reset the counter after it reaches 100.use for loop,. pls guys hepl me.. :(
How do you determine whether to use a stream function or a low-level function?
How many types of operator or there in c?
What would happen to X in this expression: X += 15; (assuming the value of X is 5)
What is the difference between if else and switchstatement
What does the c in ctime mean?
What is local and global variable in c?
What is I ++ in c programming?
How many main () function we can have in a project?
How can I invoke another program or command and trap its output?
a=10;b= 5;c=3;d=3; if(a printf(%d %d %d %d a,b,c,d) else printf("%d %d %d %d a,b,c,d);
What are the different file extensions involved when programming in C?
write a program to find the given number is prime or not
Differentiate between the = symbol and == symbol?
A variable that is defined in a specified portion of a program but can be used throughout the program a) global variable b) local variable c) character d) none
