问题1： 你能否利用下图解释快速排 序的基本思想？ [splitPoint]:pivot [first灲 [last灯 0000O000000000 for any element in for any element in this Small large this segment,the key segment,the key is not is less than pivot. To be sorted recursively less than pivot.[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