Answer Posted / sur!

void xorSwap (int *x, int *y) {
if (x != y) {
*x ^= *y;
*y ^= *x;
*x ^= *y;
}
}

What is the purpose of ftell?

1095

---

In C language what is a 'dangling pointer'?

1176

---

What is the right type to use for boolean values in c? Is there a standard type? Should I use #defines or enums for the true and false values?

1067

---

How can I do peek and poke in c?

1090

---

Can you add pointers together? Why would you?

1137

---

What is a char in c?

1005

---

What is the purpose of 'register' keyword?

1105

---

Function calling procedures? and their differences? Why should one go for Call by Reference?

1099

---

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

---

How can I copy just a portion of a string?

1323

---

in linking some of os executables are linking name some of them

2147

---

Explain how can I manipulate strings of multibyte characters?

1216

---

how can i write a program that prints out a box such that whenever i press any key8(coordinate number) on the keyboard, the box moves.

1698

---

What's a good way to check for "close enough" floating-point equality?

1179

---

What do you mean by Recursion Function?

1134

---