排序算法(c语言)

#ifndef _SORT_H_#define _SORT_H_#ifdef __cplusplusextern "C"{#endifextern void bubble_sort_up(int *arr, int len);extern void bubble_sort_down(int *arr, int len);extern void bubble_sort_up_down(int *arr, int len);extern void select_sort(int *arr, int len);extern void insert_sort(int *arr, int len);extern void heap_sort(int *arr, int len);extern void quick_sort(int *arr, int len);#ifdef __cplusplus}#endif#endif

#include <stdio.h>#include "sort.h"static void my_swap(int *arr, int i, int j);static void heap_sort_shift(int *arr, int k, int len);static void quick_sort_deal(int *arr, int lt, int rt);static void my_swap(int *arr, int i, int j){ int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp;}/***************************** bubble sort ******************************/void bubble_sort_up(int *arr, int len){ int i, j; int flag; for(i = 1; i < len; ++i) { flag = 1; for(j = len - 1; j >= i; --j) { if(arr[j] < arr[j - 1]) { my_swap(arr, j, j - 1); flag = 0; } } if(flag) { break; } }}void bubble_sort_down(int *arr, int len){ int i, j; int flag; for(i = 1; i < len; ++i) { flag = 1; for(j = 0; j < len - i; ++j) { if(arr[j] > arr[j + 1]) { my_swap(arr, j, j + 1); flag = 0; } } if(flag) { break; } }}void bubble_sort_up_down(int *arr, int len){ int i = 0; int j = len - 1; int flag; int k; while(j > i) { flag = 1; for(k = i; k < j; ++k) //down { if(arr[k] > arr[k + 1]) { my_swap(arr, k, k + 1); flag = 0; } } --j; if(flag) { break; } flag = 1; for(k = j; k > i; --k) //up { if(arr[k] < arr[k - 1]) { my_swap(arr, k, k - 1); flag = 0; } } ++i; if(flag) { break; } }}/***************************** select sort ******************************/void select_sort(int *arr, int len){ int i, j, min; for(i = 1; i < len; ++i) { min = i - 1; for(j = i; j < len; ++j) { if(arr[j] < arr[min]) { min = j; } } if(min != (i - 1)) { my_swap(arr, i - 1, min); } }}/***************************** insert sort ******************************/void insert_sort(int *arr, int len){ int tmp; int i, j, k; for(i = 1; i < len; ++i) { tmp = arr[i]; for(j = i - 1; j >= 0; --j) { if(arr[j] < tmp) {//在j之后插入tmp break; } } ++j; for(k = i; k > j; --k) { arr[k] = arr[k - 1]; } arr[j] = tmp; }}/***************************** heap sort ******************************/void heap_sort(int *arr, int len){ int i; while(len > 0) { for(i = len >> 1; i >= 0; --i) { heap_sort_shift(arr, i, len); } my_swap(arr, 0, len - 1); --len; }}static void heap_sort_shift(int *arr, int k, int len){ int lt = (k << 1) + 1; int rt, tmp; if(lt < len) { tmp = lt; rt = lt + 1; if(rt < len && arr[rt] > arr[lt]) { ++tmp; } if(arr[tmp] > arr[k]) { my_swap(arr, k, tmp); } }}/***************************** quick sort ******************************/void quick_sort(int *arr, int len){ quick_sort_deal(arr, 0, len - 1);}static void quick_sort_deal(int *arr, int lt, int rt){ int tmp; int i = lt; int j = rt; if(lt >= rt) { return; } tmp = arr[lt]; while(j > i) { while(j > i && arr[j] >= tmp) { --j; } if(j > i) { arr[i++] = arr[j]; } while(j > i && arr[i] < tmp) { ++i; } if(j > i) { arr[j--] = arr[i]; } } arr[i] = tmp; quick_sort_deal(arr, lt, i - 1); quick_sort_deal(arr, i + 1, rt);}