Example: Merge Sort Divide Step in C

C
C++
C#
Java
Python
PHP
// Merge Sort Divide Step
#include <stdio.h> // Included for main function demonstration, not strictly needed for just mergeSort prototype

// Function to recursively sort the array using mergeSort
void mergeSort(int arr[], int left, int right) {
    if (left < right) {
        // Find the middle point
        int mid = left + (right - left) / 2;

        // Sort first and second halves
        mergeSort(arr, left, mid);
        mergeSort(arr, mid + 1, right);

        // Merge the sorted halves
        // The actual merge function will be defined separately
    }
}

/*
// Example of how mergeSort would be called:
int main() {
    int arr[] = {38, 27, 43, 3, 9, 82, 10};
    int n = sizeof(arr) / sizeof(arr[0]);
    mergeSort(arr, 0, n - 1);
    // Print sorted array
    return 0;
}
*/