How to left shift k elements of an array

#include <iostream>
using namespace std;
void shiftArr(int* arr , int n)
{
    // Initially: [1 2 3 4 5]
    // swapping the first element with the last element
    int temp = arr[0];
    arr[0] = arr[n-1];
    arr[n-1] = temp;
    // Now: [5 2 3 4 1]
    // swapping the first element with the (N-i)th element for the entire length of the array (where i starts from 1)
    for(int i=n-2 ; i>=0 ; i--)
    {
        int temp2 = arr[0];
        arr[0] = arr[i];
        arr[i] = temp2;
        // Array in each iteration:
        // [4 2 3 5 1]
        // [3 2 4 5 1]
        // [2 3 4 5 1]
    }
}
void shiftArrByK(int* arr , int n , int k)
{
    for(int i=0 ; i<k%n ; i++) // we take a modulus in case the value of k is >= N
    {
        shiftArr(arr , n) ;
    }
}
int main() {
    int arr[] = {1,2,3,4,5};
    int size_of_array = 5 ;
    int k = 2 ;
    cout << "Before shifting: " ;
    for(int i=0 ; i<size_of_array ; i++)
    {
        cout << arr[i] << " " ;
    }
    cout << endl ;
    shiftArrByK(arr , size_of_array , k);
    cout << "After shifting: " ;
    for(int i=0 ; i<size_of_array ; i++)
    {
        cout << arr[i] << " " ;
    }
    cout << endl ;
}

#include <iostream>
using namespace std;
void reverseArray(int* arr , int low , int high)
{
  while(low<high)
  {
    swap(arr[low] , arr[high]);
    low++;
    high--;
  }
}
void shiftLeftByN(int* arr , int n , int k)
{
  k = k%n ; // we take a modulus in case the value of k is >= N
  reverseArray(arr , 0 , k-1);
  reverseArray(arr , k , n-1);
  reverseArray(arr , 0 , n-1);
}
int main() {
  int arr[5] = {1,2,3,4,5} ; 
  int size_of_array=5 ; 
  int k=2 ;
  cout << "Before rotation: " ;
  for(int i=0 ; i<size_of_array ; i++)
  {
    cout << arr[i] << " " ;
  }
  cout << endl ;
  shiftLeftByN(arr , size_of_array , k) ;
  cout << "After rotation: " ;
  for(int i=0 ; i<size_of_array ; i++)
  {
    cout << arr[i] << " " ;
  }
  cout << endl ;
}