Open utterances-bot opened 2 years ago
chapter 1模板快速排序算法模板——分治 ②的实现 1）暴力——开辟额外空间： 2）双指针 void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l]; while (i < j) {
https://xiaochengye.github.io/2021/10/17/Acwing%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80%E8%AF%BE%E5%A3%B9/
comments 020402
XiaochengYe
commented
2 years ago
Acwing 算法基础课 chapter 1 | HaoSengYee
chapter 1模板快速排序算法模板——分治 ②的实现 1）暴力——开辟额外空间： 2）双指针 void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l]; while (i < j) {
https://xiaochengye.github.io/2021/10/17/Acwing%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80%E8%AF%BE%E5%A3%B9/