Array Manipulation

Your Task

Create a collection of C programs that implement classic array algorithms. Each program must compile without warnings using gcc -Wall -Wextra, demonstrate the algorithm's operation clearly, and follow good coding practices with proper comments.

Your toolkit must include ALL of the following programs. Each program is mandatory and will be tested individually.

// Example function signatures
void input_array(int arr[], int size);
int calculate_sum(int arr[], int size);
double calculate_average(int arr[], int size);
int find_min(int arr[], int size);
int find_max(int arr[], int size);
int find_second_largest(int arr[], int size);
void count_even_odd(int arr[], int size, int *even, int *odd);

// Display after each pass
void bubble_sort(int arr[], int n) {
    int swaps = 0;
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                swap(&arr[j], &arr[j + 1]);
                swaps++;
            }
        }
        printf("Pass %d: ", i + 1);
        print_array(arr, n);
    }
    printf("Total swaps: %d\n", swaps);
}

// Binary search with comparison count
int binary_search(int arr[], int n, int key, int *comparisons) {
    int low = 0, high = n - 1;
    *comparisons = 0;
    
    while (low <= high) {
        int mid = (low + high) / 2;
        (*comparisons)++;
        
        if (arr[mid] == key) return mid;
        else if (arr[mid] < key) low = mid + 1;
        else high = mid - 1;
    }
    return -1;
}

#define MAX 10

void print_matrix(int mat[][MAX], int rows, int cols) {
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            printf("%4d ", mat[i][j]);
        }
        printf("\n");
    }
}

#define MAX_NAMES 5
#define MAX_LEN 50

void sort_names(char names[][MAX_LEN], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (strcmp(names[j], names[j + 1]) > 0) {
                char temp[MAX_LEN];
                strcpy(temp, names[j]);
                strcpy(names[j], names[j + 1]);
                strcpy(names[j + 1], temp);
            }
        }
    }
}

// Efficient rotation using reversal
void reverse(int arr[], int start, int end) {
    while (start < end) {
        int temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;
        start++;
        end--;
    }
}

void rotate_left(int arr[], int n, int k) {
    k = k % n;  // Handle k > n
    reverse(arr, 0, k - 1);
    reverse(arr, k, n - 1);
    reverse(arr, 0, n - 1);
}

Create a public GitHub repository with the exact name shown below:

Required Files

array-manipulation-toolkit/
├── array_stats.c          # Program 1: Statistical analysis
├── sorting.c              # Program 2: Sorting algorithms
├── searching.c            # Program 3: Searching algorithms
├── matrix.c               # Program 4: Matrix operations
├── string_array.c         # Program 5: String processing
├── rotation.c             # Program 6: Array rotation
├── Makefile               # Build all programs with: make all
└── README.md              # Documentation (see requirements below)

CC = gcc
CFLAGS = -Wall -Wextra -std=c11

all: array_stats sorting searching matrix string_array rotation

array_stats: array_stats.c
	$(CC) $(CFLAGS) -o array_stats array_stats.c

# ... similar rules for other programs

clean:
	rm -f array_stats sorting searching matrix string_array rotation

Your assignment will be graded on the following criteria: