If errno contains a nonzero number, is there an error?

0 Answers  

---

Is c procedural or object oriented?

0 Answers  

---

how to determine the complexity of an algorithm as log(n)

1 Answers   Google,

---

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 }

0 Answers   Facebook,

---

What is meant by operator precedence?

0 Answers  

---

I have one doubt. What does below statement mean? #define sizeof(operator) where operator can be int or float etc. Does this statement meaningful and where it can be used?

1 Answers  

---

A program to allow an input operand and operator from the operator and read on the display and output operand.

0 Answers  

---

How do I round numbers?

0 Answers  

---

What are pointers?

0 Answers   Accenture, Tavant Technologies, Zensar,

---

What is the use of function overloading in C?

0 Answers   Ittiam Systems,

---

swap 2 numbers without using third variable?

0 Answers   IBS,

---

how can we print  hellow world programme without using semicolon

3 Answers  

---