@jinxonik / UniLecs #202

shift_array.cpp

#include <iostream>
#include <vector>
#include <algorithm>

using std::cout;
using std::vector;

template <typename T>
void shift_array(vector<T>& array, size_t value)
{
  size_t total = array.size();
  if (value > total) {
    if (total == 0) { return; }
    value %= total;
  }
  if (value == 0) { return; }
  std::reverse(array.begin(), std::prev(array.end(), value));
  std::reverse(std::prev(array.end(), value), array.end());
  std::reverse(array.begin(), array.end());
}

int main()
{
  vector<int> arr { 1, -2, 3, -4, 5, -6, 7, -8, 9, -10 };
  shift_array(arr, 3);

  cout << "{ ";
  for (int n : arr) {
    cout << n << " ";
  }
  cout << "}\n";

  return 0;
}