Interested to Buy Any Domain ? << Click Here >> for more details...
how to determine the complexity of an algorithm as log(n)
- 1 Answers
- 3942 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 |
How can I invoke another program or command and trap its output?
Subtract Two Number Without Using Subtraction Operator
What is scope and lifetime of a variable in c?
Give me the code of in-order recursive and non-recursive.
What are the differences between Structures and Arrays?
What are called c variables?
Write a C program that will accept a hexadecimal number as input and then display a menu that will permit any of the following operations to be carried out: Display the hexadecimal equivalent of the one's complement. (b) Carry out a masking operation and then display the hexadecimal equivalent of the result. (c) Carry out a bit shifting operation and then display the hexadecimal equivalent of the result. (d) Exit. If the masking operation is selected, prompt the user lor the type of operation (bitwise and, bitwise exclusive or, or bitwise or) and then a (hexadecimal) value for the mask. If the bit shifting operation is selected. prompt the user for the type of shift (left or right), and then the number of bits. Test the program with several different (hexadecimal) input values of your own choice.
what is the coding of display the factorial of a number using array and function?
plz answer....A program that takes 3 variables e.g a,b,c in as seperate parameters and rotates the values stored so that value goes a to b, b to c and c to a .
why 'c' is called middle level language.
what is calloc and malloc?
Explain why c is faster than c++?
C 
