해커랭크(HackerRank) - Almost Sorted // C++
https://www.hackerrank.com/challenges/almost-sorted/problem Almost Sorted | HackerRank Sort an array by either swapping or reversing a segment www.hackerrank.com void segmentSort(vector* arr, int from, int to) { sort(arr->begin()+from, arr->begin()+to+1); } bool isASC(vector arr, int from, int to) { int prev = arr[from]; for(int i = from+1; i arr[i]) { return false; } prev = arr[i]; } return tru..
2021. 5. 19.
