1.
Find the Largest and Smallest Element in an Array
c
Copy
Edit
#include <stdio.h>
int main() {
int n, i, arr[100], max, min;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
max = min = arr[0]; // Assume first element
for(i = 1; i < n; i++) {
if(arr[i] > max)
max = arr[i];
if(arr[i] < min)
min = arr[i];
}
printf("Largest = %d\n", max);
printf("Smallest = %d\n", min);
return 0;
}
✅ 2. Reverse the Array
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, temp;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
// Swapping
for(i = 0; i < n/2; i++) {
temp = arr[i];
arr[i] = arr[n-1-i];
arr[n-1-i] = temp;
}
printf("Reversed Array:\n");
for(i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
✅ 3. Insert an Element at Any Position
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, pos, value;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
printf("Enter position to insert (0 to %d): ", n);
scanf("%d", &pos);
printf("Enter value to insert: ");
scanf("%d", &value);
for(i = n; i > pos; i--) {
arr[i] = arr[i-1];
}
arr[pos] = value;
n++;
printf("Array after insertion:\n");
for(i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
✅ 4. Delete an Element by Value
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, value, pos = -1;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
printf("Enter value to delete: ");
scanf("%d", &value);
// Finding position
for(i = 0; i < n; i++) {
if(arr[i] == value) {
pos = i;
break;
}
}
if(pos == -1) {
printf("Element not found.\n");
} else {
for(i = pos; i < n-1; i++) {
arr[i] = arr[i+1];
}
n--;
printf("Array after deletion:\n");
for(i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
}
return 0;
}
✅ 5. Count Even and Odd Numbers
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, even = 0, odd = 0;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for(i = 0; i < n; i++) {
if(arr[i] % 2 == 0)
even++;
else
odd++;
}
printf("Even numbers = %d\n", even);
printf("Odd numbers = %d\n", odd);
return 0;
}
✅ 6. Merge Two Arrays
c
Copy
Edit
#include <stdio.h>
int main() {
int arr1[50], arr2[50], merge[100];
int n1, n2, i, k;
printf("Enter number of elements in first array: ");
scanf("%d", &n1);
printf("Enter elements of first array:\n");
for(i = 0; i < n1; i++) {
scanf("%d", &arr1[i]);
}
printf("Enter number of elements in second array: ");
scanf("%d", &n2);
printf("Enter elements of second array:\n");
for(i = 0; i < n2; i++) {
scanf("%d", &arr2[i]);
}
// Merging
for(i = 0; i < n1; i++) {
merge[i] = arr1[i];
}
for(k = 0; k < n2; k++) {
merge[i] = arr2[k];
i++;
}
printf("Merged array:\n");
for(i = 0; i < n1+n2; i++) {
printf("%d ", merge[i]);
}
return 0;
}
✅ 7. Check if Array is Sorted or Not
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, sorted = 1;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for(i = 0; i < n-1; i++) {
if(arr[i] > arr[i+1]) {
sorted = 0;
break;
}
}
if(sorted)
printf("Array is sorted in ascending order.\n");
else
printf("Array is NOT sorted.\n");
return 0;
}
✅ 8. Sum of All Elements
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, sum = 0;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for(i = 0; i < n; i++) {
sum += arr[i];
}
printf("Sum of all elements = %d\n", sum);
return 0;
}
✅ 9. Find Second Largest Element
c
Copy
Edit
#include <stdio.h>
int main() {
int n, arr[100], i, first, second;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter elements:\n");
for(i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
if(arr[0] > arr[1]) {
first = arr[0];
second = arr[1];
} else {
first = arr[1];
second = arr[0];
}
for(i = 2; i < n; i++) {
if(arr[i] > first) {
second = first;
first = arr[i];
} else if(arr[i] > second && arr[i] != first) {
second = arr[i];
}
}
printf("Second largest element = %d\n", second);
return 0;
}
