- 博客(8)
- 收藏
- 关注
RSS订阅
1原创 算法导论-计数排序-C语言
计数排序的思想就是对每一个输入的元素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
2014-09-11 16:25:26
579
原创 算法导论-快速排序-C语言
#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
2014-09-07 20:19:10
441
原创 算法导论-优先级队列-C语言
#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
2014-09-07 15:51:26
501
原创 算法导论-堆排序-C语言
#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
2014-09-07 15:00:19
404
原创 算法导论-冒泡排序-C语言版
#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 ;
2014-09-06 19:45:26
461
原创 算法导论-插入排序算法
#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 ;
2014-09-06 19:32:35
422
原创 算法学习之归并排序-带测试样例
#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
2014-09-06 17:16:05
578
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人