Left Rotate Array by K Positions

Code

#include <stdio.h>

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) {
    // Your logic here
    // Approach 1
    /*
    for (int count = 0; count < k; count++){

        int temp = arr[0];
        for(int i = 0; i < n-1; i++){
            // Leftwards shift
            arr[i] = arr[i+1];
        }

        arr[n-1] = temp;
    }
    */

    // Approach 2
    k = k % n;
    // Reverse the first k elements
    reverse(arr, 0, k-1);
    // Reverse the last n-k elements
    reverse(arr, k, n-1);
    // Reverse the whole array
    reverse(arr, 0, n-1);
}

int main() {
    int n, k;
    scanf("%d %d", &n, &k);

    int arr[100];

    // Read array elements
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Rotate the array
    rotate_left(arr, n, k);

    // Print the rotated array
    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if(i < n-1){
        	printf(" ");
        }
    }

    return 0;
}

Solving Approach