Interested to Buy Any Domain ? << Click Here >> for more details...
how to determine the complexity of an algorithm as log(n)
- 1 Answers
- 3936 Views
- Google, I also Faced
- E-Mail Answers
Answer / 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 |
difference between loading and linking
How many bytes are occupied by near, far and huge pointers (dos)?
In which category does main function belong??
any C program contains only one function, it must be a) void () b) main () c) message () d) abc ()
what is pointer?
13 Answers HCL, TCS,
how do you redirect stdout value from a program to a file?
Describe the header file and its usage in c programming?
Which is best linux os?
int n=1; while(1) { switch(n) { case 1:printf("a"); n++; continue; case 2:printf("b"); n++; continue; default : printf("c"); break; } break; }
What is the purpose of main() function?
Which command is more efficient? *(ptr+1) or ptr[1]
What does double pointer mean in c?
C 
