一、基础算法 快速排序算法模板 void quick_sort(int q[], int l, int r) { if (l >= r) return; int i = l - 1, j = r + 1, x

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hex