how to determine the complexity of an algorithm as log(n)
- 1 Answers
- 3399 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 |
In which area global, external variables are stored?
Can we use visual studio for c?
How do I swap bytes?
How many types of functions are there in c?
Is c dynamically typed?
What is a stream in c programming?
List some of the static data structures in C?
inline function is there in c language?
How to swap two values using a single variable ? condition: Not to use Array and Pointer ?
What is the difference between c &c++?
#define DCHAR char* typedef char* TCHAR; if using these following variables will be declared like DCHAR ch1, ch2; TCHAR ch3, ch4; then what will be types of ch1, ch2, ch3 and ch4?
What is pointer in c?
C 
