[C++언어] 기수 정렬 (Radix sort) 알고리즘

#include #include #include using namespace std; void radix(int *array, int begin, int end) { // for signed-integer to be sorted correctly for (int i = begin; i <= end; i++) array[i] ^= INT_MIN; vector buf(end - begin + 1), cnt(256), idx(256); int *org = array + begin, *des = &buf[0]; for (int i = 0; i < sizeof(int); i++, swap(org, des)) { fill(cnt.begin(), cnt.end(), 0); for (int j = 0; j <= end - begin; j++) cnt[(org[j] >> (i << 3)) & 0xFF]++; idx[0] = 0; for...