Adding Array_Sum, Array_Largest, Array_TwoLargest, Array_TwoSmallest, and Array_Smallest

Arrays/AlgorithmsToDo.md

@@ -1,9 +1,4 @@
 # Arrays - TO DO
 - Reverse array
-- Sum of elements in array
-- Largest element
-- Two largest elements
-- Smallest element
-- Two smallest elements
 - Median of elements
 - Mean of elements

Arrays/Array_Largest.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+
+int largest(int *array, int size)
+{
+    int largest = array[0];
+    for (int i = 1; i < size; i++) {
+        if (array[i] > largest) {
+            largest = array[i];
+        }
+    }
+    return largest;
+}
+
+int main(void)
+{
+    #define SIZE 10
+
+    int array[SIZE] = {0};
+    int i = 0;
+
+    for (i = 0; i < SIZE; i++) {
+        array[i] = i;
+    }
+
+    printf("Largest element in array: %d\n", largest(array, SIZE));
+
+    return 0;
+}

Arrays/Array_Smallest.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+
+int smallest(int *array, int size)
+{
+    int smallest = array[0];
+    for (int i = 1; i < size; i++) {
+        if (array[i] < smallest) {
+            smallest = array[i];
+        }
+    }
+    return smallest;
+}
+
+int main(void)
+{
+    #define SIZE 10
+
+    int array[SIZE] = {0};
+    int i = 0;
+
+    for (i = 0; i < SIZE; i++) {
+        array[i] = i;
+    }
+
+    printf("Smallest element in array: %d\n", smallest(array, SIZE));
+
+    return 0;
+}

Arrays/Array_Sum.c

@@ -0,0 +1,26 @@
+#include <stdio.h>
+
+int sum(int *array, int size)
+{
+    int sum = 0;
+    for (int i = 0; i < size; i++) {
+        sum += array[i];
+    }
+    return sum;
+}
+
+int main(void)
+{
+    #define SIZE 10
+
+    int array[SIZE] = {0};
+    int i = 0;
+
+    for (i = 0; i < SIZE; i++) {
+        array[i] = i;
+    }
+
+    printf("Sum of elements in array: %d\n", sum(array, SIZE));
+
+    return 0;
+}

Arrays/Array_TwoLargest.c

@@ -0,0 +1,42 @@
+#include <stdio.h>
+
+void twoLargest(int *array, int size, int *largest, int *secondLargest)
+{
+    if (array[0] > array[1]) {
+        *largest = array[0];
+        *secondLargest = array[1];
+    } else {
+        *largest = array[1];
+        *secondLargest = array[0];
+    }
+    for (int i = 2; i < size; i++) {
+        if (array[i] > *largest) {
+            *secondLargest = *largest;
+            *largest = array[i];
+        } else if (array[i] > *secondLargest) {
+            *secondLargest = array[i];
+        }
+    }
+}
+
+int main(void)
+{
+    #define SIZE 10
+
+    int array[SIZE] = {0};
+    int i = 0;
+    int largest = 0;
+    int secondLargest = 0;
+
+    for (i = 0; i < SIZE; i++) {
+        array[i] = i;
+    }
+
+    twoLargest(array, SIZE, &largest, &secondLargest);
+
+    printf("Largest element in array: %d\n", largest);
+
+    printf("Second largest element in array: %d\n", secondLargest);
+
+    return 0;
+}

Arrays/Array_TwoSmallest.c

@@ -0,0 +1,42 @@
+#include <stdio.h>
+
+void twoSmallest(int *array, int size, int *smallest, int *secondSmallest)
+{
+    if (array[0] < array[1]) {
+        *smallest = array[0];
+        *secondSmallest = array[1];
+    } else {
+        *smallest = array[1];
+        *secondSmallest = array[0];
+    }
+    for (int i = 2; i < size; i++) {
+        if (array[i] < *smallest) {
+            *secondSmallest = *smallest;
+            *smallest = array[i];
+        } else if (array[i] < *secondSmallest) {
+            *secondSmallest = array[i];
+        }
+    }
+}
+
+int main(void)
+{
+    #define SIZE 10
+
+    int array[SIZE] = {0};
+    int i = 0;
+    int smallest = 0;
+    int secondSmallest = 0;
+
+    for (i = 0; i < SIZE; i++) {
+        array[i] = i;
+    }
+
+    twoSmallest(array, SIZE, &smallest, &secondSmallest);
+
+    printf("Smallest element in array: %d\n", smallest);
+
+    printf("Second smallest element in array: %d\n", secondSmallest);
+
+    return 0;
+}