# include <stdio.h>
# include <string.h>
int main(void)
{
    int arr[] = {5, 2, 3, -8, 34, 76, 32, 43, 0, -70, 35, 543, 6};
    int len= sizeof(arr) / sizeof(arr[0]);;  
    int i;  //比較的輪數(shù)
    int j;  //每輪比較的次數(shù)
    int temp;  //交換數(shù)據(jù)時(shí)用于存放中間數(shù)據(jù)
    for (i=0; i<len-1; ++i)  //比較n-1輪
    {
        for (j=0; j<len-1-i; ++j)  //每輪比較n-1-i次,
        {
            if (arr[j] < arr[j+1])
            {
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
    printf("排序后:\n");
    for (i=0; i<len; ++i)
    {
        printf("%d\x20", arr[i]);
    }
    printf("\n");
    return 0;
}

#include <stdio.h>
# include <string.h>
int main() {
        int arr[] = { 5, 2, 3, -8, 34, 76, 32, 43, 0, -70, 35, 543, 6};
        int len = (int) sizeof(arr) / sizeof(*arr);
       int i, j, temp;
        for (i = 0; i < len - 1; i++)
                for (j = 0; j < len - 1 - i; j++)
                        if (arr[j] > arr[j + 1]) { 
                                temp = arr[j];
                                arr[j] = arr[j + 1];
                                arr[j + 1] = temp;
                        }
        for (i = 0; i < len; i++)
                printf("%d ", arr[i]);
        return 0;
}

#include <stdio.h>
# include <string.h>
int main(){
     int arr[] = { 5, 2, 3, -8, 34, 76, 32, 43, 0, -70, 35, 543, 6};
  int len = (int) sizeof(arr) / sizeof(*arr);
	int i,j,x; 
    for( i= 1; i<len; i++){
        if(arr[i] < arr[i-1]){//若第 i 個(gè)元素大于 i-1 元素則直接插入；反之，需要找到適當(dāng)?shù)牟迦胛恢煤笤诓迦搿?
             j= i-1;
             x = arr[i];
            while(j>-1 && x < arr[j]){  //采用順序查找方式找到插入的位置，在查找的同時(shí)，將數(shù)組中的元素進(jìn)行后移操作，給插入元素騰出空間
                arr[j+1] = arr[j];
                j--;
            }
            arr[j+1] = x;      //插入到正確位置
        }
}
    for(j=0; j<len; j++){
        printf("%d ",arr[j]);
    }
    printf("\n");
    return 0;
}

# include <string.h>
#include <stdio.h>
void merging(int *list1, int list1_size, int *list2, int list2_size) {
    int i,j,k, m;
    int temp[MAXSIZE];
    i = j = k = 0;
    while(i < list1_size && j < list2_size)
    {
        if(list1[i] < list2[j])
        {
            temp[k] = list1[i];
            k++;
            i++;
        }
        else
        {
            temp[k++] = list2[j++];
        }
    }
    while(i < list1_size)
    {
        temp[k++] = list1[i++];
    }
    while(j < list2_size)
    {
        temp[k++] = list2[j++];
    }
    for(m = 0;m < (list1_size + list2_size);m++)
    {
        list1[m] = temp[m];
    } }
void MergeSort(int k[], int n) {
    if(n > 1)
    {
        /*
        *list1是左半部分，list2是右半部分
        */
        int *list1 = k;
        int list1_size = n/2;
        int *list2 = k + list1_size;
        int list2_size = n - list1_size;
        MergeSort(list1, list1_size);
        MergeSort(list2, list2_size);
        // 把兩個(gè)合在一起
        merging(list1, list1_size, list2, list2_size);
    }
}
int main() {
    int i, arr[] = { 5, 2, 3, -8, 34, 76, 32, 43, 0, -70, 35, 543, 6};    int len = (int) sizeof(arr) / sizeof(*arr); 
    MergeSort(arr, len);
    printf("排序后的結(jié)果是：");
    for(i = 0;i < len;i++)
    {
        printf("%d", a[i]);
    }
    printf("\n\n");
    return 0; 
}

#include "stdio.h"
typedef struct _Range {
    int start, end;    //開(kāi)始指向分別指向兩端 
} Range;
Range new_Range(int s, int e) {
    Range r;
    r.start = s;     //開(kāi)始指向需要排序數(shù)組的兩端 
    r.end = e;
    return r;   //返回一個(gè)結(jié)構(gòu)體 
}
void swap(int *x, int *y) {   //交換數(shù)據(jù)函數(shù) 
    int t = *x;
    *x = *y;
    *y = t;
}
void quick_sort(int arr[], const int len) {
    if (len <= 0)
        return;    //保證數(shù)據(jù)長(zhǎng)度大于0 
    Range r[len];
    int p = 0;
    r[p++] = new_Range(0, len - 1);
    while (p) {
        Range range = r[--p];
        if (range.start >= range.end)
            continue;
        int mid = arr[(range.start + range.end) / 2]; // 選取中間點(diǎn)作為基準(zhǔn)點(diǎn) 
        int left = range.start, right = range.end;
        do {
            while (arr[left] < mid) ++left;   // 檢測(cè)基準(zhǔn)點(diǎn)左側(cè)是否符合要求
            while (arr[right] > mid) --right; //檢測(cè)基準(zhǔn)點(diǎn)右側(cè)是否符合要求
            if (left <= right) {
                swap(&arr[left], &arr[right]);
                left++;
                right--;               // 移動(dòng)指針以繼續(xù)
            }
        } while (left <= right);
        if (range.start < right) r[p++] = new_Range(range.start, right);
        if (range.end > left) r[p++] = new_Range(left, range.end);
    }
}
int main()
{
	int j;
	  int arr[] = { 5, 2, 3, -8, 34, 76, 32, 43, 0, -70, 35, 543, 6};
        int len = (int) sizeof(arr) / sizeof(*arr);
        quick_sort(arr,len);
            for(j=0; j<len; j++){
        printf("%d ",arr[j]);
    }
    printf("\n");
}