Answer Posted / rajamanickam.m

#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int n,flag=0,ctr;
printf("enter the number to be checked\n");
scanf("%d",&n);
for(ctr=2;ctr<=sqrt(n);ctr++)
{
if(n%ctr==0)
{
flag=1;
break;
}
}
if(flag==0)
printf("the given number is prime\n");
else
printf("the given number is not prime\n");
getch();
}

Difference between exit() and _exit() function?

1077

---

C program to find all possible outcomes of a dice?

2277

---

which type of aspect you want from the student.

2115

---

What happens if header file is included twice?

1090

---

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 }

3127

---

What are examples of structures?

1026

---

‎How to define structures? · ‎

1032

---

What are operators in c?

962

---

hi any body pls give me company name interview conduct "c" language only

2231

---

How do I use strcmp?

1024

---

Calculate 1*2*3*____*n using recursive function??

1982

---

What does. int *x[](); means ?

1014

---

When I set a float variable to, say, 3.1, why is printf printing it as 3.0999999?

997

---

How do you list files in a directory?

1076

---

Write the control statements in C language

1130

---