DELETE THE CHARCTER FROM A GIVEN POSITION

#include<stdio.h>

#include<conio.h>

#include<string.h>

void del(char *str, char ch);

void main() {

char str[50];

char *p;

char ch;

p=str;

printf("\nEnter the string : ");

gets(p);

printf("\nEnter character which you want to delete : ");

scanf("%c", &ch);

del(str, ch);

getch();

void del(char *str, char ch) {

 int i, j = 0;

int size;

char ch1;

size = strlen(str);

for (i = 0; i < size; i++) {

if (*(str+i) != ch)

*(str+j )= *(str+i);

j++;

*(str+j)='\0';

puts(str);

DYNAMIC MEMORY

#include<stdio.h>

#include<stdlib.h>

void main()

{
 int i,n,*a,j,t;

printf("Enter thec array size\n");

scanf("%d",&n);

a=(int*)calloc(n,sizeof(int));

if(a==NULL)

exit (1);

else

printf("Enter the array elements\n");

for(i=0;i<n;i++)

scanf("%d",a+i);

for(i=0;i<n-1;i++)

for(j=i+1;j<n;j++)

if(*(a+i)>*(a+j))

t=*(a+i);

*(a+i)=*(a+j);

*(a+j)=t;

}
printf("After sorting the array elemnts are\n");

for(i=0;i<n;i++)

printf("%d\n ",*(a+i));

FUNCTION POINTERS

#include<stdio.h>

int check_prime(int);

int (*fun_ptr)(int);

main()

int n, result;

printf("Enter an integer to check whether it is prime or not.\n");

scanf("%d",&n);

fun_ptr=check_prime;

result = fun_ptr(n);

if ( result == 1 )

printf("%d is prime.\n", n);

else
 printf("%d is not prime.\n", n);

return 0;

int check_prime(int a)

int c;

for ( c = 2 ; c <= a - 1 ; c++ )

if ( a%c == 0 )

return 0;

if ( c == a )

return 1;