golang 快速排序

func QuickSort(dataList []int) []int {
   return  DFSQuickSort(dataList,0,len(dataList)-1)
}

func DFSQuickSort(dataList []int,left,right int) []int {
   if  left >= right{
      return dataList
   }

   i, j := left,right

   temp := dataList[i]


   for(i != j){
      for(temp < dataList[j]) && i<j{
         j--
      }

      for(temp > dataList[i]) && i<j{
         i++
      }

      if i < j {
         dataList[i], dataList[j] = dataList[j], dataList[i]
      }

   }

   //交换基数
   temp,dataList[i] = dataList[i],temp

   DFSQuickSort(dataList,left, i-1)
   DFSQuickSort(dataList,i+1,right)

   return dataList
}