how to execute with out main in cprogram
Answers were Sorted based on User's Feedback
Answer / rina
any c program is not run without main function
main function is compalsary in c program
| Is This Answer Correct ? | 6 Yes | 8 No |
Answer / rakesh
nice 1 ravinder..!!!
great work..!!
m also having same ans.!!
| Is This Answer Correct ? | 0 Yes | 3 No |
Answer / shashank
isme bhi yahi ho raha hai
but with a trick
pls anyone can give me good links(url) to master c
| Is This Answer Correct ? | 0 Yes | 5 No |
main() { int i=0; while(+(+i--)!=0) i-=i++; printf("%d",i); }
What is this pointer in c plus plus?
How to check whether string is a palindrome, WITHOUT USING STRING FUNCTIONS?
2 Answers Aricent, Manipal University,
What is a pointer value and address in c?
what is diffrence between linear and binary search in array respect to operators?what kind of operator can be used in both seach methods?
How do you do dynamic memory allocation in C applications?
Is c object oriented?
main() { int a=5; printf(?%d,%d,%d\n?,a,a< <2,a>>2); } Answer: 5,20,1 please explain this code in detail
What are called c variables?
int a=1,b=2,c=3; printf("%d,%d",a,b,c); What is the output?
GIVEN A FLOATING POINT NUMBER HOW IS IT ACTUALLY STORED IN MEMORY ? CAN ANYONE EXPLAIN?? THE 32 BIT REPRESENTATION OF A FLOATING POINT NUMBER ALLOTS: 1 BIT-SIGN 8 BITS-EXPONENT 23 BITS-MANTISSA
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<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }