Answer Posted / manvi

main()
{
int i,j,n;
printf("enter the limit");
scanf("%d",&n);
for(i=1;i<=n;i++)
{

for(j=0;j<i;j++)
{
printf("%d",i);
}
printf("\n");
}

}

a formula,a series of steps,or well defined set of rules for solving a problem a) algorithem b) program c) erdiagram d) compiler

1085

---

Is there any possibility to create customized header file with c programming language?

1072

---

"%u" unsigned integer print the a) address of variable b) value of variable c) name of a variable d) none of the above

1031

---

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

---

What is merge sort in c?

1053

---

Explain how does free() know explain how much memory to release?

1086

---

How can I swap two values without using a temporary?

1116

---

What is the usage of the pointer in c?

1147

---

What is bubble sort technique in c?

991

---

Difference between malloc() and calloc() function?

1213

---

Can you please explain the difference between malloc() and calloc() function?

1131

---

Write a program to swap two numbers without using third variable?

1318

---

How do you search data in a data file using random access method?

1312

---

Is main a keyword in c?

1142

---

What are high level languages like C and FORTRAN also known as?

1177

---