Multikey quicksortとかTernary quicksortとか呼ばれるやつ．（参考： 続・アルゴリズムを学ぼう 4.7 接尾辞配列(SuffixArray)）multikey_quick_sort.cpp � �" V `=�$ V #include <iostream> #include <string> #include <vector> #include <algorithm> #include <assert.h> using namespace std; // pivotを選ぶ． char find_pivot_char(vector<string> &data, int left, int right, int depth) { assert(0 <= left); assert(right <= data.size()); assert(left + 1 <= right); char a = data[left].size() <= depth ? -1 : data[left][depth]; char b = data[(l
