Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include <algorithm>
- using namespace std;
- vector <int> Pendulum (vector <int> values)
- {
- vector <int> Result;
- sort(values.begin(), values.end());
- if( values.size() % 2 != 0)
- {
- for(int i = values.size() - 1; i >= 0; i--)
- {
- Result.push_back( values[i] );
- i--;
- }
- for(int i = 1; i < values.size(); i++)
- {
- Result.push_back( values[i] );
- i++;
- }
- }
- else
- {
- for(int i = values.size() - 2; i >= 0; i--)
- {
- Result.push_back( values[i] );
- i--;
- }
- for(int i = 1; i < values.size(); i++)
- {
- Result.push_back( values[i] );
- i++;
- }
- }
- return Result ;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement