Notes

Prime number checking


#include<stdio.h>
int main()
{
int n,i,m=0,flag=0;
printf("Enter the number to check prime:");
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
if(n%i==0)
{
printf("Number is not prime");
flag=1;
break;
}
}
if(flag==0)
printf("Number is prime");
return 0;
}




Linear Search



void main()
{ int num;

int i, search, found = 0;

printf("Enter the number of elements ");
scanf("%d", &num);
int array[num];
printf("Enter the elements one by one n");
for (i = 0; i < num; i++)
{
scanf("%d", &array[i]);
}

printf("Enter the element to be searched ");
scanf("%d", &search);

for (i = 0; i < num ; i++)
{
if (search == array[i] )
{
found = 1;
break;
}
}
if (found == 1)
printf("Element is present in the array at position %d",i+1);
else
printf("Element is not present in the arrayn");
}





String Palindrome




#include<stdio.h>

int main()
{
char string[40];
int length=0, flag=1,i;

printf("Enter string:n");
scanf("%s",string);

for(i=0;string[i]!='';i++)
{
length++;
}

for(i=0;i< length/2;i++)
{
if( string[i] != string[length-1-i] )
{
flag=0;
break;
}
}

if(flag==1)
{
printf("PALINDROME");
}
else
{
printf("NOT PALINDROME");
}
return 0;
}