qian2729的专栏

#include #include #define MAX_INT 655354#define NUM 16void mergeSort(int array[],int p,int r);void merge(int array[], int p, int q, int r);int main(){ int array[NUM] = {23,12,3,4,2,3,234,56

#include #include #define MAX_INT 655354#define NUM 16void bubbleSort(int array[], int length);int main(){ int array[NUM] = {23,12,3,4,2,3,234,5655,34,123,445,44,3,4,56,78}; int i ;

#include #include #define MAX_INT 655354#define NUM 16void heapSort(int array[],int length);void exchange(int array[],int a, int b);void printArray(int array[], int length);int main(){ in

#include #include #define MAX_INT 655354#define NUM 16void insertSort(int array[],int length);int main(){ int array[NUM] = {23,12,3,4,2,3,234,5655,34,123,445,44,3,4,56,78}; int i ;

#include #include #define MAX_INT 655354#define NUM 16void mergeSort(int array[],int p,int r);void merge(int array[], int p, int q, int r);void insertSort(int array[],int length);void bu

#define MIN_INT (-65535)int heapSize;void exchange(int array[],int a, int b);void maxHeapify(int array[], int i);int main(){ printf("Hello world!\n"); return 0;}void maxHeapify(int a

计数排序的思想就是对每一个输入的元素x，确定出小于x的个数，直接把x放入最终输出数组的位置上。#include #include #define MAX_INT 65535#define NUM 16void mergeSort(int array[],int p,int r);void merge(int array[], int p, int q, int r);void in