https://blog.youkuaiyun.com/llqq200410zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/llqq200410/article/details/146148977https://blog.youkuaiyun.com/llqq200410/article/details/146148977llqq200410Mon, 10 Mar 2025 12:00:43 +0800https://blog.youkuaiyun.com/llqq200410/article/details/146074722https://blog.youkuaiyun.com/llqq200410/article/details/146074722llqq200410Fri, 07 Mar 2025 15:03:26 +0800> 12.递归排序left和right数组3.合并left和right数组（最重要）合并left和right数组（最重要）的方法：定义i和j两个指针i指针指向的时left数组中最小的元素。j指针指向的时rigth数组中最小的元素。定义tmp[k]数组为空数组。while（）循环，条件：i与j指向的元素都不为空，就是left与right数组都未被全部遍历。比较i与j两个元素的值。]]>https://blog.youkuaiyun.com/llqq200410/article/details/146095109https://blog.youkuaiyun.com/llqq200410/article/details/146095109llqq200410Fri, 07 Mar 2025 14:26:37 +0800=x的数组定义i和j两个指针。i指针的意义是i之前的所有元素都小于x，即q[l]到q[i]之间的元素都小于x。j指针的含义是j之后的所有元素的值都>=x,即q[j]到q[r]之间的元素都大于等于x。while(ix,那么j--；]]>https://blog.youkuaiyun.com/llqq200410/article/details/145872963https://blog.youkuaiyun.com/llqq200410/article/details/145872963llqq200410Wed, 26 Feb 2025 11:05:08 +0800https://blog.youkuaiyun.com/llqq200410/article/details/142885323https://blog.youkuaiyun.com/llqq200410/article/details/142885323llqq200410Sat, 12 Oct 2024 20:02:02 +0800https://blog.youkuaiyun.com/llqq200410/article/details/138036764https://blog.youkuaiyun.com/llqq200410/article/details/138036764llqq200410Sun, 21 Apr 2024 16:24:15 +0800https://blog.youkuaiyun.com/llqq200410/article/details/138035666https://blog.youkuaiyun.com/llqq200410/article/details/138035666llqq200410Sun, 21 Apr 2024 15:38:29 +0800