Scribd
Upload
5 views8 pages

1D arrays

Codes

Uploaded by

ishapandit1603
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
5 views8 pages

1D arrays

Codes

Uploaded by

ishapandit1603
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/ 8

1) Array:

#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int s = sizeof(arr) / sizeof(arr[0]);

printf("Array: [");
for (int i = 0; i < s; i++)
{
if (i < s - 1)
{
printf("%d, ", arr[i]);
} else {
printf("%d", arr[i]);
}
}
printf("]\n");

return 0;
}

Output:
Array: [1, 8, 7]

=== Code Execution Successful ===

2) Find index of element


#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};

printf("Array: [%d, %d, %d]\n", arr[0], arr[1], arr[2]);

int index = 1;
printf("Index of the 2nd element: %d\n", index);

return 0;
}
Output:
Array: [1, 8, 7]
Index of the 2nd element: 1
3) Search no:
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int searchIndex = 2;
printf("Array: [%d, %d, %d]\n", arr[0], arr[1], arr[2]);
printf("The 3rd number in the array is: %d\n", arr[searchIndex]);

return 0;
}
Output:
Array: [1, 8, 7]
The 3rd number in the array is: 7

4) Ascending/ Descending
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int x = sizeof(arr) / sizeof(arr[0]);
int t;

printf("Original Array: [");


for (int i = 0; i < x; i++) {
printf("%d", arr[i]);
if (i < x- 1) {
printf(",");
}
}
printf("]\n");

for (int i = 0; i < x; i++) {


for (int j = i + 1; j < x; j++) {
if (arr[i] > arr[j]) {
t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
}

printf("Sorted Array in Ascending Order: [");


for (int i = 0; i < x; i++) {
printf("%d", arr[i]);
if (i < x - 1) {
printf(",");
}
}
printf("]\n");

return 0;
}
Output:
Original Array: [1,8,7]
Sorted Array in Ascending Order: [1,7,8]

5) Insert element
#include <stdio.h>

int main() {
int arr[5] = {1, 8, 7};
int insertElement1 = 6;
int insertElement2 = 10;

printf("Original Array: [%d, %d, %d]\n", arr[0], arr[1], arr[2]);

arr[3] = insertElement1;
arr[4] = insertElement2;

printf("Modified Array: [%d, %d, %d, %d, %d]\n", arr[0], arr[1], arr[2], arr[3], arr[4]);

return 0;
}
Output:
Original Array: [1, 8, 7]
Modified Array: [1, 8, 7, 6, 10]
6) Delete element
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int n = sizeof(arr) / sizeof(arr[0]);
int newArr[n];
int j = 0;

for (int i = 0; i < n; i++) {


if (arr[i] != 1 && arr[i] != 7) {
newArr[j] = arr[i];
j++;
}
}

printf("Array after deletion: ");


for (int i = 0; i < j; i++) {
printf("%d ", newArr[i]);
}

return 0;
}
Output:
Array after deletion: 8
7) Largest no:
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int size = sizeof(arr) / sizeof(arr[0]);
int max = arr[0];

printf("Array: [");
for (int i = 0; i < size; i++) {
printf("%d", arr[i]);
if (i < size - 1) {
printf(",");
}
}
printf("]\n");

for (int i = 1; i < size; i++) {


if (arr[i] > max) {
max = arr[i];
}
}

printf("Largest Number: %d\n", max);

return 0;
}
Output:
Array: [1,8,7]
Largest Number: 8
8) Sum of Array
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int sum = 0;

printf("Array: [");
for (int i = 0; i < 3; i++) {
printf("%d", arr[i]);
if (i < 2) {
printf(",");
}
}
printf("]\n");

for (int i = 0; i < 3; i++) {


sum += arr[i];
}

printf("Sum of Array: %d\n", sum);

return 0;
}
Output
Array: [1,8,7]
Sum of Array: 16
9) Mean, median, mode
#include <stdio.h>

int main() {
int arr[] = {1, 8, 7};
int n = sizeof(arr) / sizeof(arr[0]);
int sum = 0, mean, mode, maxCount = 0;

printf("Array: [");
for (int i = 0; i < n; i++) {
printf("%d", arr[i]);
if (i < n - 1) {
printf(",");
}
}
printf("]\n");

for (int i = 0; i < n; i++) {


sum += arr[i];
}
mean = sum / n;
printf("Mean: %d\n", mean);

for (int i = 0; i < n; i++) {


int count = 0;
for (int j = 0; j < n; j++) {
if (arr[j] == arr[i]) {
count++;
}
}
if (count > maxCount) {
maxCount = count;
mode = arr[i];
}
}
printf("Mode: %d\n", mode);

int temp;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] > arr[j]) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
int median;
if (n % 2 == 0) {
median = (arr[n / 2 - 1] + arr[n / 2]) / 2;
} else {
median = arr[n / 2];
}
printf("Median: %d\n", median);

return 0;
}
Output
Array: [1,8,7]
Mean: 5
Mode: 1
Median: 7

10) Standard Deviation/Variance


#include <stdio.h>
#include <math.h>

int main() {
int arr[] = {1, 8, 7};
int n = sizeof(arr) / sizeof(arr[0]);
double sum = 0.0, mean, variance = 0.0, std_deviation;

for (int i = 0; i < n; i++) {


sum += arr[i];
}

mean = sum / n;

for (int i = 0; i < n; i++) {


variance += pow(arr[i] - mean, 2);
}

variance /= n;
std_deviation = sqrt(variance);

printf("Array: [%d, %d, %d]\n", arr[0], arr[1], arr[2]);


printf("Variance: %.2f\n", variance);
printf("Standard Deviation: %.2f\n", std_deviation);

return 0;
}
Output:
Array: [1, 8, 7]
Variance: 9.56
Standard Deviation: 3.09

11) Fibonacci Series


#include <stdio.h>

int main() {
int a[] = {1, 8, 7};
int n = sizeof(a) / sizeof(a[0]);

int fib[n];
fib[0] = 0;
fib[1] = 1;

for (int i = 2; i < n; i++) {


fib[i] = fib[i-1] + fib[i-2];
}

printf("Fibonacci series for the given array length: \n");


for (int i = 0; i < n; i++) {
printf("%d ", fib[i]);
}

return 0;
}
Output
Fibonacci series for the given array length:
011

You might also like