#include <stdio.h>
#include <conio.h>
int main()
{
int i, a[10], loc1=0, loc2=0, max1=0, max2=0;
for(i=1; i<=5; i++)
{
printf("Enter number: ");
scanf("%d", &a[i]);
}
for(i=1; i<=5; i++)
{
if(max1<a[i])
{
max2=max1;
max1=a[i];
loc2=loc1;
loc1=i;
}
if(max2<a[i] && a[i]<max1)
{
max2=a[i];
loc2=i;
}
}
printf("First largest is %d at %d and Second largest is %d at %d",max1, loc1, max2, loc2);
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int i, a[10], loc, item;
for(i=0; i<=9; i++)
{
printf("Enter number %d: ", i);
scanf("%d", &a[i]);
}
printf("Enter location where you want to enter number: ");
scanf("%d", &loc);
printf("Enter number: ");
scanf("%d", &item);
for(i=10; i>loc; i--)
{
a[i]=a[i-1];
}
a[loc]=item;
for(i=0; i<=10; i++)
{
printf("%d ", a[i]);
// scanf("%d", &a[i]);
}
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int c, f, l, midl, n, s, array[100];
printf("Enter number of elements: ");
scanf("%d",&n);
printf("Enter %d integers: ", n);
for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);
printf("Enter value to find: ");
scanf("%d",&s);
f = 0;
l = n - 1;
midl = (f+l)/2;
while( f <= l )
{
if ( array[midl] < s )
f = midl + 1;
else if ( array[midl] == s )
{
printf("%d found at location %d.", s, midl+1);
break;
}
else
l = midl - 1;
midl = (f + l)/2;
}
if ( f > l )
printf("Not found! %d is not present in the list.", s);
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int array[100], s, d, number;
printf("Enter the number of elements in array: ");
scanf("%d",&number);
printf("Enter %d numbers: ", number);
for ( d = 0 ; d < number ; d++ )
scanf("%d",&array[d]);
printf("Enter the number to search: ");
scanf("%d",&s);
for ( d = 0 ; d < number ; d++ )
{
if ( array[d] == s )
{
printf("%d is present at location %d.", s, d+1);
break;
}
}
if ( d == number )
printf("%d is not present in array.", s);
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int array[100], p, c, n, value;
printf("Enter size of array: ");
scanf("%d", &n);
printf("Enter %d elements: ", n);
for (c = 0; c < n; c++)
scanf("%d", &array[c]);
printf("Enter the location where you wish to insert an element: ");
scanf("%d", &p);
printf("Enter the value to insert: ");
scanf("%d", &value);
for (c = n; c >= p; c--)
array[c+1] = array[c];
array[p-1] = value;
printf("Resul of array is: ");
for (c = 0; c < n; c++)
printf("%d ", array[c]);
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int a[10], i, temp;
printf("Enter Numbers to sort: ");
for(i=0; i<=9; i++)
{
scanf("%d", &a[i]);
}
for(i=0; i<=9; i++)
{
if(a[i+1]<a[i])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
i=-1;
}
}
for(i=0; i<=9; i++)
{
printf("%d ", a[i]);
}
getch();
}
#include <stdio.h>
#include <conio.h>
int main()
{
int i;
char str1[]="This is Exersize 1.";
char str2[20], ch, ch2;
i=0;
while(ch!='.')
{
str2[i]=ch=str1[i];
i++;
}
i=0;
while(ch2!='.')
{
ch2=str2[i];
printf("%c", ch2);
i++ ;
}
getch();
}