类属算法rotate对区间内的元素进行循环移位操作，如: rotate(first,middle,last) 将区间[first,last)内的元素循环左移middle-first个位置
#include
<
iostream
>
#include < cassert >
#include < algorithm >
#include < vector >
#include < string >
using namespace std;
int main()
{
cout << " Illustrating the generic rotate algorithm. " << endl;
string s( " Software Engineering " );
vector < char > vector1(s.begin(),s.end());
rotate(vector1.begin(),vector1.begin() + 9 ,vector1.end());
assert( string (vector1.begin(),vector1.end()) == string ( " Engineering Software " ));
cout << " --- OK. " << endl;
return 0 ;
}
#include < cassert >
#include < algorithm >
#include < vector >
#include < string >
using namespace std;
int main()
{
cout << " Illustrating the generic rotate algorithm. " << endl;
string s( " Software Engineering " );
vector < char > vector1(s.begin(),s.end());
rotate(vector1.begin(),vector1.begin() + 9 ,vector1.end());
assert( string (vector1.begin(),vector1.end()) == string ( " Engineering Software " ));
cout << " --- OK. " << endl;
return 0 ;
}
![现有一个接口DataOperation定义了排序方法sort(int[])和查找方法search(int[],int)，已知类QuickSort的quickSort(int[])方法实现了快速排序算法](https://ucc.alicdn.com/b3c447iaqrtq2_20240813_8507e56fc1e0475c88702b767789ed11.png?x-oss-process=image/resize,h_160,m_lfit)
