shorting algorithmS

0 Answers   Wipro,

---

Write a C program to accept a matrix of any size. Find the frequency count of each element in the matrix and positions in which they appear in the matrix

0 Answers   CLG,

---

What is memory leak in c?

0 Answers  

---

What are categories used for in c?

0 Answers  

---

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,

---

List at least 10 sorting methods indicating their average case complexity, worst case complexity and best case complexity.

0 Answers   Ignou,

---

What do the functions atoi(), itoa() and gcvt() do?

0 Answers   Aspire, Infogain,

---

Tell me is null always defined as 0(zero)?

0 Answers  

---

How can variables be characterized?

0 Answers  

---

size maximum allocated by calloc()

3 Answers   DELL,

---

why we are using float in C

4 Answers  

---

Explain how do you declare an array that will hold more than 64kb of data?

0 Answers  

---