We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
void findZigZagSequence(vector &a, int n) {
sort(a.begin(), a.end());
int mid = (n-1)/2;
swap(a[mid], a[n-1]);
int st = mid+1;
int ed =n-2;
while (st < ed) {
swap(a[st], a[ed]);
st++;
ed--;
}
for (int i=0; i<n; i++) {
if (i>0) cout << " ";
cout<<a[i];
}
cout<<endl;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Zig Zag Sequence
You are viewing a single comment's thread. Return to all comments →
void findZigZagSequence(vector &a, int n) { sort(a.begin(), a.end()); int mid = (n-1)/2; swap(a[mid], a[n-1]);
}