![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
程序人生
Liam__
新生小白
展开
-
数据结构-排序
一、冒泡排序#include <iostream>using namespace std;void swap(int &a, int &b) { int temp = a; a = b; b = temp; }void Bubble_Sort(int *p, int length) { for (int i = 0; i < 10; i++) {原创 2017-12-14 21:33:12 · 294 阅读 · 0 评论 -
数据结构-线性表
一、线性表的顺序实现#include <iostream> #include <cstdlib>#define OK 1 #define ERROR 0#define LIST_INIT_SIZE 100 #define LISTINCREMENT 10typedef int Elemtype; typedef int Status;using namespace原创 2017-12-29 11:04:48 · 229 阅读 · 0 评论 -
数据结构-线性表
一、线性表的顺序实现#include <iostream> #include <cstdlib>#define OK 1 #define ERROR 0#define LIST_INIT_SIZE 100 #define LISTINCREMENT 10typedef int Elemtype; typedef int Status;using namespace原创 2017-12-29 11:05:02 · 210 阅读 · 0 评论 -
数据结构-线性表
一、线性表的顺序实现#include <iostream> #include <cstdlib>#define OK 1 #define ERROR 0#define LIST_INIT_SIZE 100 #define LISTINCREMENT 10typedef int Elemtype; typedef int Status;using namespace原创 2017-12-29 11:05:51 · 208 阅读 · 0 评论