Professional Documents
Culture Documents
Updated Manuals of Data
Updated Manuals of Data
This program shall determine the Maximum and Minimum Number entered by the user and also tell the positive or
negative numbers
CODE:
#include "stdafx.h"
#include<iostream>
#include<conio.h>
if(lower==upper)
{
return arr[lower];
}
max=large(arr,lower+1,upper);
if(arr[lower>max])
return arr[lower];
else
return max;
}
int main()
{
int n;
cout<<"enter size of array"<<endl;
cin>>n;
int arr[100];
for(int i=0;i<n;i++)
{
cout<<"enter "<<i+1<<"element"<<endl;
cin>>arr[i];
}
cout<<"array is"<<endl;
for(int i=0;i<n;i++)
{
cout<<arr[i]<<endl;
}
cout<<"min element"<<endl;
cout<<large(arr,0,n-1);
getch();
return 0;}
OUTPUT:
sum=sum+(i*rem);
dec=dec/2;
i=i*10;
}while(dec>0);
cout<<"value in Binary is "<<endl;
cout<<sum<<endl;
break;
}
case 'B':
{
cout<<"conversion of decimal to octal"<<endl;
int octal,to=0;
int i=1;
int total[50];
cout<<"enter value in decimal"<<endl;
cin>>octal;
while(octal>0)
{
to=octal%8;
octal/=8;
total[i++]=to;
}
for(int j=i-1;j>0;j--)
{
cout<<total[j];
}
break;
}
case 'C':
{
int dec,rem,x;
char hex[100];
int i=1,j,y;
cout<<"enter decimal"<<endl;
cin>>dec;
x=dec;
while(x!=0)
{
y=x%16;
if(y<10)
{
y=y+48;
}
else
{
y=y+55;
}
hex[i++]=y;
x=x/16;
}
cout<<"hex"<<endl;
for(j=i-1;j>0;j--)
{
cout<<hex[j];
}}
}
getch();
return 0;
}
OUTPUT:
CODE:
// program.cpp : main project file.
#include "stdafx.h"
#include<iostream>
#include<conio.h>
using namespace std;
{
cout<<b[j]<<endl;
}
return 0;
}
int deletion(int c[5])
{
for(int l=0;l<4;l++)
{
cout<<c[l]<<endl;
}
return 0;
}
int sort(int array[5])
{
for(int q=0; q<5; q++)
{
cout<<array[q];
cout<<endl;
}
return 0;
}
int search()
{
return 0;
}
int main()
{
cout<<"
cout<<endl;
cout<<endl;
int q=0;
"
<<endl;
cout<<"
"<<endl;
cout<<"
"<<endl;
cout<<"
"<<endl;
cout<<"
cout<<endl;
cin>>q;
if(1==q)
{
int a[50];
int n,x,i,index=0;
cout<<"enter size of array"<<endl;
cin>>n;
cout<<"enter array values"<<endl;
for(i=0;i<n;i++)
{
cin>>a[i];
"<<endl;
}
cout<<"enter value to be inserted"<<endl;
cin>>x;
int u;
cout<<"enter index value "<<endl;
cin>>u;
for(i=0;i<n;i++)
{
index=i+u;
break;
}
for(i=n+1;i>index;--i)
a[i]=a[i-1];
a[index]=x;
insertion(a);
}
else if (2==q)
{
int a[50];
int n=5;
int i=0;
int k;
cout<<"enter index"<<endl;
cin>>k;
cout<<"Enter values of array"<<endl;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<"array is "<<endl;
for(i=0;i<5;i++)
{
cout<<a[i]<<endl;
while(k<=n)
{
a[k]=a[k+1];
k++;
}
n=n-1;
cout<<"after deletion array is"<<endl;
deletion(a);
}
else if(3==q)
{
int arr[5];
int mini,temp;
for(int r1=0;r1<4;r1++)
{
mini=r1;
for(int r2=r1+1; r2<5; r2++)
if(arr[r2]<arr[mini])
mini=r2;
if(mini !=r1)
{
temp=arr[r1];
arr[r1]=arr[mini];
arr[mini]=temp;
}
}
cout<<"sorted array "<<endl;
sort(arr);
}
else if(4==q)
{
int a[5];
if(a[i]==skey)
{
found=1;
break;
}
}
if(found==1)
else
cout<<"element not found"<<endl;
}
getch();
return 0;
}
OUTPUT:
CODE:
// merge.cpp : main project file
#include "stdafx.h"
#include <iostream>
#include<conio.h>
using namespace std;
void merge(int *,int, int , int );
void mergesort(int *a, int low, int high)
{
int mid;
i++;
}
while (j <= high)
{
c[k] = a[j];
k++;
j++;
}
for (i = low; i < k; i++)
{
a[i] = c[i];
}
}
int main()
{
int a[20], i, b[20];
cout<<"enter the elements\n";
CODE:
// recur.cpp : main project file.
#include "stdafx.h"
#include<iostream>
#include<conio.h>
cin>>n;
int arr[100];
for(int i=0;i<n;i++)
{
cout<<"enter "<<i+1<<"element"<<endl;
cin>>arr[i];
}
cout<<"array is"<<endl;
for(int i=0;i<n;i++)
{
cout<<arr[i]<<endl;
}
cout<<"min element"<<endl;
cout<<large(arr,0,n-1);
getch();
return 0;
}