Thread: What's wrong with STL rotate algorithm?

Code:

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

using namespace std;

int main()
{
	int i, m, n;
	int *d;
	cin >> m;
	cin >> n;
	d = new int[m];
	for (i = 0; i < m; i++)
		cin >> d[i];
	
	vector<int> v(d, d+m);
	for (vector<int>::size_type i = 0; i < v.size(); i++)
		cout << v.at(i) << " ";
	cout << endl;
	rotate(v.begin(), v.begin()+n, v.end());
		for (vector<int>::size_type i = 0; i < v.size(); i++)
		cout << v.at(i) << " ";
	cout << endl;
	delete []d;
}

The output shows

Code:

debian:~# ./10039
10 12
4
5
7
1
2
4
2
3
9
7
4 5 7 1 2 4 2 3 9 7
7 1 2 4 2 3 9 7 0 135073
*** glibc detected *** free(): invalid next size (fast): 0x0804c038 ***
Aborted

What's matter about the error?

if I try to change rotate part to

Code:

for (i = 0; i < n; i++)
  rotate(v.begin(), v.begin()+1, v.end());

It works fine. Can I do this action in 1 line?

I think you can simulate a 'multiple rotate' by using n % m as the middle.