Module2 Split Pages 5-7-10-13
Module2 Split Pages 5-7-10-13
h>
int main(){
int arr[10], i, num, n, pos=-1;
printf("Enter the array size: ");
scanf("%d", &n);
printf("Enter Array Elements: ");
for(i=0; i<n; i++)
{
scanf("%d", &arr[i]);
}
printf("Enter the number to be searched: ");
scanf("%d", &num);
for(i=0; i<n; i++)
{
if(arr[i]==num)
{
pos = i+1;
printf("Element %d found at position %d", num, pos);
break;
}
}
if (pos == -1)
{
printf("Number not found..!!\n");
}
return 0;
}
Output:
Enter the array size: 5 Enter the array size: 5
Enter Array Elements: 7 1 2 6 9 Enter Array Elements: 7 1 2 6 9
Enter the number to be searched: 2 Enter the number to be searched: 8
Element 2 found at position 3 Number not found..!!
10 14 27 33 35
Array is sorted
#include<stdio.h>
int main(){
int n, i, arr[50], j, temp;
printf("Enter total number of elements: ");
scanf("%d", &n);
printf("Enter the elements: ");
for(i=0; i<n; i++)
scanf("%d", &arr[i]);
for(i=0; i<(n-1); i++)
{ Output:
temp=arr[j]; 1 3 5 8 9
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
printf("Elements sorted successfully..!!\n");
printf("Sorted list in ascending order :\n");
for(i=0; i<n; i++)
printf("%d\t", arr[i]);
return 0;
}
123456789
10 11 12 13 14 15 16 17 18
1 2 3 10 11 12
4 5 6 13 14 15
7 8 9 16 17 18
Resultant matrix:
11 13 15
17 19 21
23 25 27