排序

冒泡

python:

li=[1,5,3,6,8,6,3,2]

for i in range(len(li)-1,0,-1):
    for j in range(0,i):
        if li[j]>li[j+1]:
            li[j],li[j+1]=li[j+1],li[j]


print li

 

快排

C#:

public static void QuickSort(this int[] arr, int left, int right)
        {
            if (left < right)
            {
                int middle = arr[(left + right) / 2];
                int i = left - 1;
                int j = right + 1;
                while (true)
                {
                    while (arr[++i] < middle && i <right) ;
                    while (arr[--j] > middle && j>0) ;
                    if (i >= j)
                        break;
                    int n = arr[i];
                    arr[i]=arr[j];
                    arr[j] = n;

                }

                QuickSort(arr, left, i - 1);
                QuickSort(arr, j + 1, right);
            }
        }