0% found this document useful (0 votes)
3 views12 pages

Aascending Merged

The document contains multiple C programs that demonstrate various array operations including sorting, finding maximum and minimum values, deleting elements, and calculating sums. Each program prompts the user for input and performs specific tasks such as finding alternate elements, counting positive and negative numbers, and calculating the maximum difference between array elements. The code snippets illustrate fundamental programming concepts and array manipulations in C.

Uploaded by

anushkarokade21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views12 pages

Aascending Merged

The document contains multiple C programs that demonstrate various array operations including sorting, finding maximum and minimum values, deleting elements, and calculating sums. Each program prompts the user for input and performs specific tasks such as finding alternate elements, counting positive and negative numbers, and calculating the maximum difference between array elements. The code snippets illustrate fundamental programming concepts and array manipulations in C.

Uploaded by

anushkarokade21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

D:\c language\aascending.

c 1
#include<stdio.h>
void main()
{
int i;
int min;
int min_index;
int j;
int temp;
int a[10];
printf("Enter the elements");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<0;i++)
{
min=a[i];
min_index=i;
for(j=0;j<10;j++)
{
if(min>a[j])
{
min=a[j];
min_index=j;
}
temp=a[i];
a[i]=a[min_index];
a[min_index]=temp;

}
}
for(i=0;i<10;i++)
{
printf("%d\t",a[i]);
}
}
D:\c language\alternate.c 1
#include<stdio.h>
void main()
{
int a[10];
int i;
printf("Enter 10 elements");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
printf("Array=\n");
for(i=0;i<0;i++)
{
printf("%d\t",a[i]);

}
printf("\n Alternate elements=\n");
for(i=0;i<10;i=i+2)
{
printf("%d\t",a[i]);
}

}
c:\Users\sunil\OneDrive\documents\visual studio 2012...\ConsoleApplication46\ConsoleApplication46\array.c 1
//COMPARISON OF NUMBER
#include<stdio.h>
void main()
{
int greater=0;
int smaller=0;
int equal=0;
int arr[10];
int i;

printf("Enter the value of arrays");


for(i=0;i<10;i++)
{
scanf("%d",&arr[i]);

}
for(i=0;i<10;i++)
{
if(arr[i]<0)
{
smaller++;

}
else if(arr[i]>0)
{
greater++;

}
else
{
equal++;

}
}
printf("%d\n",greater);
printf("%d\n",smaller);
printf("%d\n",equal);
}
D:\c language\delete.c 1
#include<stdio.h>
void main()
{
int a[10];
int i;
int j;
int del;
int delindex;
printf("Enter the values in array");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
printf("Enter the element to be deleted");
scanf("%d",&del);
for(i=0;i<10;i++)
{
if(a[i]==del)
{
delindex=i;
break;
}
}
for(j=delindex;j<9;j++)
{
a[j]=a[j+1];
}
for(i=0;i<9;i++)
{
printf("%d",a[i]);
}
}
c:\Users\sunil\OneDrive\documents\visual studio 2012...\ConsoleApplication49\findnumber.c 1
//program to find a number
#include<stdio.h>
void main()
{
int anu[6];
int i;
int j;
int n=25;
printf("Enter the elements in array");
for(i=0;i<6;i++)
{
scanf("%d",&anu[i]);
}
i=0;
j=6-1;
while(i<=j)
{

if(anu[i]==n)
{
printf("Number is found");
break;

}
else if(anu[j]==n)
{
printf("Number found");
break;
}
i++;
j--;
}
}
D:\c language\maxdifference.c 1
#include<stdio.h>
void main()
{
int anu[10];
int i;
int j;
int min;
int max;
int diff;
printf("Enter 10 elements");
for(i=0;i<10;i++)
{
scanf("%d",&anu[i]);
}
min=anu[0];
max=anu[0];
for(i=0;i<10;i++)
{
if(anu[i]<min)
{
min=anu[i];
}
if(anu[i]>max)
{
max=anu[i];
}
}
diff=max-min;
printf("maximum difference between array is %d",diff);
}
C:\Users\sunil\OneDrive\Desktop\array\mymaxmin.c 1
//maximum
#include<stdio.h>
void main()
{
int n=10;
int max;
int i;
int j;
int arr[10];
printf("Enter the value of array");
for(i=0;i<10;i++)
{
scanf("%d",&arr[i]);
}
max=arr[0];
for(j=0;j<n;j++)
{
if(arr[j]<max)
{
max=arr[j];
}
}
printf("%d",max);
}
C:\Users\sunil\OneDrive\Desktop\array\mymin.c 1
//maximum
#include<stdio.h>
void main()
{
int n=10;
int max;
int i;
int j;
int k;
int arr[10];
printf("Enter the value of array");
for(i=0;i<10;i++)
{
scanf("%d",&arr[i]);
}
max=arr[0];
for(j=0;j<n;j++)
{
if(arr[j]<max)
{
max=arr[j];
}
}
if( max>arr[i] && max<arr[j])
{ printf("%d",max);
}
}
C:\Users\sunil\OneDrive\Desktop\array\second.max.c 1
//maximum
#include<stdio.h>
void main()
{
int n=10;
int max;
int i;
int j;
int k;
int arr[10];
printf("Enter the value of array");
for(i=0;i<10;i++)
{
scanf("%d",&arr[i]);
}
max=arr[0];
for(i=0;i<n;i++)
{
if(max<arr[i])
{
j=max;
max=arr[i];
}
}

{
printf("second largest element is %d",j);
}
}
D:\c language\squarearray.c 1
1 #include<stdio.h>
2 void main()
3 {
4 int a[10];
5 int i;
6 int sum=0;
7 printf("Enter 10 elements");
8 for(i=0;i<10;i++)
9 {
10 scanf("%d",&a[i]);
11 }
12 printf("original array\n");
13 for(i=0;i<10;i++)
14 {
15 printf("%d\t",a[i]);
16 }
17 for(i=0;i<10;i++)
18 {
19 a[i]=a[i]*a[i];
20 }
21 printf("array of square");
22 for(i=0;i<10;i++)
23 {
24 printf("%d\t",a[i]);
25
26 }
27
28 }
D:\c language\array.c 1
//sum of array is
#include<stdio.h>
void main()
{
int anu[10];
int i;
int j;
int sum=0;
printf("Enter the value of array");
for(i=0;i<10;i++)
{
scanf("%d",&anu[i]);
}
for(i=0;i<10;i++)
{
sum=sum+anu[i];

}
printf("%d The sum of array is",sum);
}
D:\c language\total.c 1
#include<stdio.h>
void main()
{
int a[10]={1,2,3,4,5};
int i=0,count=0;
while(a[i]!=0)
{
printf("%d",a[i]);
i++;
}
for(i=0;i<10;i++)
{
if(a[i]!='\0')
{
count++;
}
}
printf("Number of elements in array %d",count);
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy