![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
he_yang_
这个作者很懒,什么都没留下…
展开
-
二叉树遍历
二叉树遍历原创 2022-06-26 18:22:10 · 156 阅读 · 0 评论 -
十大排序之归并排序
cpp代码实现#include <iostream>#include <ctime>#include <cstdlib> #include <cstdio>#define N 50typedef struct { int data[1024]; int length;} IntList;using namesp...原创 2020-02-05 19:25:55 · 129 阅读 · 1 评论 -
十大排序之简单选择排序
//// Created by hejinyang on 2019/12/11.//#include <stdio.h>#include <stdlib.h>#include <time.h>#define LENGTH 10void swap(int &a, int &b) { int tmp = a; ...原创 2019-12-13 19:09:57 · 88 阅读 · 0 评论 -
十大排序之冒泡排序
//// Created by hejinyang on 2019/12/11.//#include <stdio.h>#include <stdlib.h>#include <time.h>#define LENGTH 100void swap(int &a, int &b) { int tmp = a; ...原创 2019-12-13 18:48:20 · 80 阅读 · 0 评论 -
十大排序之折半插入排序
//// Created by hejinyang on 2019/12/11.//#include <stdio.h>#include <stdlib.h>#include <time.h>#define LENGTH 100int BinarySearch(int *data, int low, int high, int key) ...原创 2019-12-12 00:18:13 · 84 阅读 · 0 评论 -
十大排序之插入排序
//// Created by hejinyang on 2019/12/11.//#include <stdio.h>#include <stdlib.h>#include <time.h>#define LENGTH 100void InsertSort(int *data, int size) { int tmp; i...原创 2019-12-11 23:34:51 · 86 阅读 · 0 评论 -
十大排序之快速排序
//// Created by hejinyang on 2019/12/9.//#include <stdio.h>#include <stdlib.h>#include <time.h>#define LENGTH 50int partition(int *data, int low, int high) { // 返回最后元素枢轴位...原创 2019-12-11 23:00:24 · 100 阅读 · 0 评论 -
数据结构线性表之顺序表
数据结构1. 线性表(linear list)1.1 顺序表宏定义#define OK 1#define ERROR 0#define INFEASIBLE (-1)#define OVERFLOW (-2)typedef int Status;#define INIT_SIZE 100#define INCREMENT 10节点定义template<typen...原创 2019-07-23 10:35:00 · 130 阅读 · 0 评论