Interested to Buy Any Domain ? << Click Here >> for more details...
#include <stdio.h>
int main ( int argc, char* argv [ ] )
{
int value1 = 10;
int value2 = 5;
printf ( "\n The sum is :%d", value1 | value2 );
}
This is the answer asked by some one to add two numbers
with out using arithmetic operator?Yes this answer is write
it given out put as 15.But how?????
what is need of following line?
int main ( int argc, char* argv [ ] )
how it work?what is the meaning for this line?
please explain me.Advance thanks
- 9 Answers
- 16797 Views
- Excel, I also Faced
- E-Mail Answers
Answer Posted / harish
i think wat rahul explained is true...but one correction to
be made is that main takes three arguments.... i dnt exactly
remember wat its called......
| Is This Answer Correct ? | 0 Yes | 3 No |
Post New Answer View All Answers
What is string length in c?
What is an operator?
What is pass by reference in c?
Why isn't it being handled properly?
What is the purpose of sprintf() function?
What is self-referential structure in c programming?
What is maximum size of array in c?
What is call by reference in functions?
What oops means?
What is the purpose of the following code? Is there any problem with the code? void send(int count, short *to, short *from) { /* count > 0 assumed */ register n = (count + 7) / 8; switch (count % 8) { case 0: do { *to = *from++; case 7: *to = *from++; case 6: *to = *from++; case 5: *to = *from++; case 4: *to = *from++; case 3: *to = *from++; case 2: *to = *from++; case 1: *to = *from++; } while (--n > 0); } }
What is the general form of a C program?
Can a function argument have default value?
write a program to print largest number of each row of a 2D array
What is #define used for in c?
You have given 2 array. You need to find whether they will
create the same BST or not.
For example:
Array1:10 5 20 15 30
Array2:10 20 15 30 5
Result: True
Array1:10 5 20 15 30
Array2:10 15 20 30 5
Result: False
One Approach is Pretty Clear by creating BST O(nlogn) then
checking two tree for identical O(N) overall O(nlogn) ..we
need there exist O(N) Time & O(1) Space also without extra
space .Algorithm ??
DevoCoder
guest
Posted 3 months ago #
#define true 1
#define false 0
int check(int a1[],int a2[],int n1,int n2)
{
int i;
//n1 size of array a1[] and n2 size of a2[]
if(n1!=n2) return false;
//n1 and n2 must be same
for(i=0;i
