1)--->program to printf alphabetical in reverse pyramid way:

#include<stdio.h>
#include<conio.h>
main()
{
int row,c,d,k,temp1,temp2,temp3;
clrscr();
temp2=65;
temp1=temp2+6;
temp3=temp1-1;
d=temp3;
for(row=0;row<7;row++)
{
c=temp2;
do{
printf("%c",c);
c++;
}while(c<=temp1);
temp1--;
for(c=1;c<=2*row-1;c++)
printf(" ");
do{
printf("%c",d);
d--;
}while(d>=temp2);
d=temp3-row;
printf("\n");
}
getch();
}
2)(put it last)program for dynamic spiral matrix:
#include<stdio.h>
#include<conio.h>
#include<alloc.h>
int min,max,i,j;
main()
{
int r,k,m,n;
int **a,rows,col;
clrscr();
printf("enter number of elements:");
scanf("%d",&n);
rows=n;col=n;
(a)[rows]=(int(*))malloc(rows*sizeof(int));
for(i=0;i<rows;i++)
((*a)[i])=(int *)malloc(col*sizeof(int));
min=0;max=n-1;r=1;
for(k=0;k<n-1;k++)
{
for(j=min+k;j<(max-k);j++)
{
i=min+k;
a[i][j]=r++;
}
for(i=min+k;i<(max-k);i++)
{

j=max-k;
a[i][j]=r++;
}
for(j=max-k;j>(min+k);j--)
{
i=max-k;
a[i][j]=r++;
}
for(i=max-k;i>=(min+1)+k;i--)
{
j=min+k;
a[i][j]=r++;
}
}
if(n%2!=0)
{
m=n/2;
a[m][m]=n*n;
}
printf("array is:\n\n");
for(i=0;i<rows;i++)
{
for(j=0;j<col;j++)
printf("\t %d",a[i][j]);
printf("\n");
}
getch();
}
3)--->program to findout prime factors
#include<stdio.h>
#include<conio.h>
void prime(int);
void primeodd(int);
int i,x;
main()
{
clrscr();
int num;
printf("enter number");
scanf("%d",&num);
prime(num);
getch();
}
void prime(int num)
{
if(num%2==0)
{
printf("2\n");
num=num/2;
prime(num);
}
else primeodd(num);
}
void primeodd(int num)
{
int p;
p=num;

for(x=3;x<8;x++)
if(num%x==0)
{
printf("%d\n",x);
num=num/x;
}
if(p!=num)
primeodd(num);
else if(p>1)
printf("%d",p)
}
4)--->program to print a matrix in reverse way:
#include<stdio.h>
#include<conio.h>
func(int val[],int arr[][4],int);
main()
{
clrscr();
int arr[4][4]={{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16}};
int val[3]={0};
int r=0;
func(val,arr,r);
getch();
}
func(int val[],int arr[][4],int r)
{
int i,j,k;
i=j=k=0;
while(i<4)
{
val[i]=arr[0+r][i++];
}
while(j<4)
{
arr[0+r][j]=arr[3-r][j++];
}
while(k<4)
{
arr[3-r][k]=val[k++];
}
r++;
if(r<2)
func(val,arr,r);
else
for(i=0;i<4;i++)
{
for(j=0;j<4;j++)
printf("\t\t %d",arr[i][j]);
printf("\n");
}
}
5)--->roman number program upto four digits
#include<stdio.h>
#include<conio.h>

#include<math.h>
void roman(int,int);
void rome(int,char,char);
void rmn(int,int);
main()
{
int n,rem,nod=0,count,remainder,rev=0,num;
clrscr();
printf("enter a number upto four digits:");
scanf("%d",&num);
while(num>0)
{
remainder=num%10;
rev=rev*10+remainder;
num/=10;
nod++;
}
count=nod-1;
n=rev;
while(rev>0)
{
rem=rev%10;
roman(count,rem);
count--;
rev/=10;
}
getch();
}
void roman(int count,int rem)
{
int i;
if(count>2)
for(i=0;i<rem;i++)
printf("m");
if(count==2)
rome(rem,'d','c');
if(count==1)
rome(rem,'l','x');
if(count==0)
{
if(rem==9)
printf("ix");
if (rem==4)
printf("iv");
if(rem>4 && rem<9)
{
printf("v");
rmn(rem,5);
}
if(rem>=1 && rem<4)
rmn(rem,0);
}
}
void rmn(int rem,int j)
{
int i;
for(i=0;i<abs(rem-j);i++)
printf("i");
}
void rome(int rem,char p,char s)

{
int i,r1;
{
if(rem>=5)
{
printf("%c",p);
r1=rem-5;
for(i=0;i<r1;i++)
printf("%c",s);
}
else
for(i=0;i<rem;i++)
printf("%c",s);
}
}
6)--->program for insertion sort:
#include<stdio.h>
#include<conio.h>
#ddefine SIZE 6
main()
{
clrscr();
int arr[SIZE];
int i,j,temp,element,k;
printf("enter elements for array");
for(k=0;k<SIZE-1;k++)
{
scanf("%d",&arr[k]);
}
printf("enter element for insertion:");
scanf("%d",&element);
arr[SIZE-1]=element;
for(j=SIZE-1,i=SIZE-2;j>0,i>=0;j--,i--)
{
if(arr[i]>arr[j])
{
temp=arr[j];
arr[j]=arr[i];
arr[i]=temp;
}
else
break;
}
for(i=0;i<SIZE;i++)
printf("arr[%d]:%d\n",i+1,arr[i]);
getch();
}
7)--->program for bubble sort
#include<stdio.h>
#include<conio.h>
#define SIZE 6
main()
{
clrscr();

int arr[SIZE];
int i,j,temp,k;
k=SIZE;
printf("enter the elements of array:");
for(i=0;i<SIZE;i++)
scanf("%d",&arr[i]);
while(k>1)
{
for(i=0,j=i+1;i<SIZE,j<SIZE-1;i++,j++)
{
if(arr[i]>arr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}}
k--;
}
for(i=0;i<SIZE;i++)
printf("arr[%d]:%d\n",i+1,arr[i]);
getch();
}
8)--->program for merge sort
#include<stdio.h>
#include<conio.h>
#define SIZE1 6
#define SIZE2 6
static int i=0,j=0,k=0;
main()
{
clrscr();
int arr1[SIZE1]={31,32,33,34,35,36};
int arr2[SIZE2]={21,22,23,24,25,26};
int arr3[12]={0};
while(i<SIZE1 && j<SIZE2)
{
if(arr1[i]>arr2[j])
{
arr3[k++]=arr2[j++];
}
else
arr3[k++]=arr1[i++];
}
if(i==SIZE1)
do
{
arr3[k++]=arr2[j++];
}while(j<=SIZE1);
else if(j==SIZE2)
do
{
arr3[k++]=arr1[i++];
}while(i<=SIZE1);
for(k=0;k<12;k++)
printf("arr[%d] is :%d\n",k,arr3[k]);
getch();
}

9)--->program for 2-d array tournment:

#include<stdio.h>
#include<conio.h>
#define COL 8
#define ROw 3
func(int val[][COL],int);
main()
{
clrscr();
int val[ROW][COL]={0};
int i=0,r=0;
printf("enter elements of array:");
for(i=0;i<COL;i++)
scanf("%d",&val[r][i]);
func(val,r);
getch();
}
func(int val[][COL],int r)
{
int i=0,k=0,j=1;
do{
{
if(val[r][i]>val[r][j])
val[r+1][k++]=val[r][i];
else
val[r+1][k++]=val[r][j];
}
i=i+2;
j=j+2;
}while(k<(COL/2));
r++;
if(r<=ROW)
func(val,r);
else
printf("\n");
for(i=0;i<r;i++)
{
for(j=0;j<(COL/(i+1));j++)
printf("\t\t %d",val[i][j]);
printf("\n");
}
}
10)--->program for binary search:
#include<stdio.h>
#include<conio.h>
#define SIZE 10
void func(int val[],int num,int low,int up,int mid);
int low,up,mid;
main()
{
clrscr();
int arr[SIZE],i,k;
printf("enter elements of array:");

for(i=0;i<SIZE;i++)
scanf("%d",&arr[i]);
printf("enter element to be searched");
scanf("%d",&k);
low=0;
up=SIZE-1;
mid=(up+low)/2;
func(arr,k,low,up,mid);
getch();
}
void func(int val[],int num,int low,int up,int mid)
{
mid=(low+up)/2;
if(num>val[mid])
{
low=mid+1;
func(val,num,low,up,mid);
}
else if(num<val[mid])
{
up=mid-1;
func(val,num,low,up,mid);
}
else if(num==val[mid])
{
printf("sucess\n");
printf("found at position:%d",mid);
return;
}
}
11)--->program to allocate memory using pointer
#include<stdio.h>
#include<conio.h>
void func(int *);
main()
{
clrscr();
int *p;
func(p);
getch();
}
void func(int *p)
{
int arr[500]={0};
p=arr;
printf("size of array:%d",sizeof(int));
}

12)--->program to create array dynamically

#include<stdio.h>
#include<alloc.h>
main()
{

int **a,i,j,rows,col;
clrscr();
printf("enter number of rows & columns:");
scanf("%d%d",&rows,&col);
(a)[rows]=(int (*))malloc(rows*sizeof(int));
for(i=0;i<rows;i++)
((*a)[i])=(int *)malloc(col*sizeof(int));
printf("enter elements of array:");
for(i=0;i<rows;i++)
for(j=0;j<col;j++)
scanf("%d",&arr[i][j]);
for(i=0;i<rows;i++)
{
for(j=0;j<col;j++)
printf("%d",a[i][j]);
printf("\n");
}
}