这是我的快速排序代码,它选择最正确的值作为轴心:
def qsort_right(self, array):
less = []
equal = []
greater = []
last_value = len(array) - 1
if len(array) > 1:
pivot = array[last_value]
for i in array:
if i < pivot:
less.append(i)
if i == piv
I在寻找实现算法的类。我在网上找到了一些代码.
package sun.misc;
public class Sort {
private static void swap(Object arr[], int i, int j) {
Object tmp;
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
/**
* quicksort the array of objects.
*
* @param arr[] - an array of objects