/* This is HW4_8 Lab EE107
The purpose of this function an array for descending and ascending order.
Creating the code and free of syntax and grammatical errors.
Author: Ekwegbalum Unachukwu
Star ID:do2170dt
Due Date: April 26th, 2024.
*/
#include <stdio.h>

// Function to sort an array in ascending order
void sortAscending_EU(int arr_EU[], int size_EU) {
    for (int i_EU = 0; i_EU < size_EU - 1; i_EU++) {
        for (int j_EU = 0; j_EU < size_EU - i_EU - 1; j_EU++) {
            if (arr_EU[j_EU] > arr_EU[j_EU + 1]) {
                // Swap elements
                int temp_EU = arr_EU[j_EU];
                arr_EU[j_EU] = arr_EU[j_EU + 1];
                arr_EU[j_EU + 1] = temp_EU;
            }
        }
    }
}

// Function to sort an array in descending order
void sortDescending_EU(int arr_EU[], int size_EU) {
    for (int i_EU = 0; i_EU < size_EU - 1; i_EU++) {
        for (int j_EU = 0; j_EU < size_EU - i_EU - 1; j_EU++) {
            if (arr_EU[j_EU] < arr_EU[j_EU + 1]) {
                // Swap elements
                int temp_EU = arr_EU[j_EU];
                arr_EU[j_EU] = arr_EU[j_EU + 1];
                arr_EU[j_EU + 1] = temp_EU;
            }
        }
    }
}

int main() {
    int array_EU[] = {34, -5, 6, 12, 100, 56, 22, 44, -3, -9, 12, 17, 22, 6, 11}; // Sample array
    int size_EU = sizeof(array_EU) / sizeof(array_EU[0]); // Calculate the size of the array

    // Print the original arrangement
    printf("Original Arrangement: ");
    for (int i_EU = 0; i_EU < size_EU; i_EU++) {
        printf("%d ", array_EU[i_EU]);
    }
    printf("\n");

    // Sort the array in ascending order
    sortAscending_EU(array_EU, size_EU);
    printf("Ascending Order: ");
    for (int i_EU = 0; i_EU < size_EU; i_EU++) {
        printf("%d ", array_EU[i_EU]);
    }
    printf("\n");

    // Sort the array in descending order
    sortDescending_EU(array_EU, size_EU);
    printf("Descending Order: ");
    for (int i_EU = 0; i_EU < size_EU; i_EU++) {
        printf("%d ", array_EU[i_EU]);
    }
    printf("\n");

    return 0;
}