Answer Posted / gagan

answer is 3
bcz b[0]=6 so b[-1]=3

Can you write a programmer for FACTORIAL using recursion?

1049

---

What are the header files used in c language?

1055

---

What does a function declared as pascal do differently?

1141

---

What are the 4 types of unions?

1046

---

Why pointers are used in c?

1018

---

Why can’t we compare structures?

1283

---

Tell me about low level programming languages.

1137

---

How to draw the flowchart for structure programs?

9348

---

What type is sizeof?

1043

---

Which header file is essential for using strcmp function?

1489

---

What is the difference between struct and union in C?

1321

---

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 }

3194

---

Can we access array using pointer in c language?

1096

---

in ‘C’ language for Matrix Multiplication fails” Introspect the causes for its failure and write down the possible reasons for its failure.

8056

---

How can I write functions that take a variable number of arguments?

1133

---