问题1： 你能否利用下图解释快速排 序的基本思想？ [first灲 [splitPoint]:pivot [last] 0000O0100000000 for any element in this for any element in this segment,the key small large segment,the key is not less than pivot. is less than pivot. To be sorted recursively[first] [last] for any element in this segment, the key is less than pivot. for any element in this segment, the key is not less than pivot