4

#define min((a),(b)) ((a)<(b))?(a):(b)
main()
{
int i=0,a[20],*ptr;
ptr=a;
while(min(ptr++,&a[9])<&a[8]) i=i+1;
printf("i=%d\n",i);}

Question Posted / bj

3 Answers
16130 Views
I also Faced
E-Mail Answers

Answer Posted / bj

Is This Answer Correct ?

0 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

any function have arguments one or more OR not . it is compulsary a) any function compulsary have one or more arguments b) any function did not have arguments. It is not compulsary c) it is optional it is not compulsary d) none of the above

1056

What is the heap?

1152

What is a static function in c?

1104

Describe the header file and its usage in c programming?

1010

What is the use of the function in c?

968

Is c weakly typed?

965

What is the return type of sizeof?

1025

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;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3126

What is dynamic dispatch in c++?

989

What is the difference between if else and switchstatement

1837

Why & is used in scanf in c?

1047

What is derived datatype in c?

1038

what type of questions arrive in interview over c programming?

1977

Is malloc memset faster than calloc?

1015

What are the 5 types of inheritance in c ++?

960