数据结构文档

冒泡排序//冒泡排序—从左向右扫描数据，选择最大的数据，放在右边。

比较相邻两数，如果左边的数大于右边的数就进行交换#include <iostream>using namespace std;void BubbleSort(int list[], int n);int main(){int a[] = {2,4,6,8,0,1,3,5,7,9};BubbleSort(a,10);for(int i=0; i < 10; i++)cout << a[i] <<"" ;return 0;}void BubbleSort(int list[], int n){for(int i = 0; i < n ; i++)//如果是n个数，就扫描n-1次{for(int j=0; j< n-i-1; j++){if(list[j] > list[j+1])std::swap(list[j],list[j+1]);}}}选择排序//要点：选择排序选最小的，往左边选(找到最小的，放在左边，不需交换)；冒泡排序选最大的冒泡：每次都要交换；选择：扫描完交换一次#include <iostream>//选择排序----将当前未排序的整数中找到一个最小的整数将它放在已排序的列表之后using namespace std;void SelectSort(int *a, const int n);int main(){int x[] = {9,8,4,5,2,7,6,3,1,0};SelectSort(x, 10);for(int k =0; k < 10; k++)cout << x[k] <<"";return 0;}void SelectSort(int *a, const int n){for(int i = 0; i < n; i++){int min = i;//min就是毛巾for(int j = i+1; j < n; j++){ //注：0~i之间是排好序的，i~n-1之间是未排序的if(a[j] < a[min])min = j;//与冒泡排序不同}swap(a[i],a[min]);}}顺序查找#include <iostream>using namespace std;//没有排序的查找只能是顺序查找。

顺序查找比较慢int SequentialSearch(int *a, const int n, const int x);int main(){int x[] = {9,8,4,5,2,7,6,3,1,0};int result;result = SequentialSearch(x, 10, 0);if(result == -1)cout <<"can't find the element!"<< endl;elsecout <<"在m["<< result <<"]"<<"找到了0"<< endl;return 0;}int SequentialSearch(int *a, const int n, const int x){int i;for(int i = 0; i < n; i++){if(a[i] == x)return i;}if(i == n)return -1;}折半查找#include <iostream>//折半查找--二分查找。

数据必须先排序，否则只能顺序查找using namespace std;int BinarySearch(int *a, const int x, const int n);int main(){int x[] = {1,2,3,4,5,6,7,8,9};int result;result = BinarySearch(x, 5, 10);if(result < 0)cout <<"没找到！"<< endl;elsecout <<"在x["<<result <<"]找到"<< 5;return 0;}int BinarySearch(int *a, const int x, const int n){//返回值是下标int low, mid,high;low = 0, high = n-1;while(low <= high){mid = (low+high)/2;if(a[mid] == x)return mid;else if(a[mid] < x)low = mid+1;else if(a[mid] > x)high = mid -1;}return -1;}快速排序#include <iostream>using namespace std;//快速排序运用的是递归算法template<class Type>void QuickSort(Type *a, const int left, const int right){if(left < right){//选枢轴进行划分—左边不断的向中间靠拢，右边也不断的向中间靠拢int i=left;int j=right+1;//为什么是+1，会使循环条件更简单int pivot = a[left];do{do i++; while(a[i]<pivot);do j--; while(a[j]>pivot);if(i<j) swap(a[i], a[j]);}while(i < j);swap(a[left], a[j]);//循环结束后，将枢轴放在中间如图2所示，经过交换原来的枢轴就放在中间的j的位置了QuickSort(a, left, j-1);QuickSort(a, j+1, right);}//确定枢轴，找到左边小于枢轴的以及，右边大于枢轴的，交换位置，然后继续选....//直至i(左)≥j(右)停止。

然后将左边第一次划分的比枢轴大的进行第二次划分}int main(){int k[] = {8,6,4,2,0,1,3,5,7,9,99};QuickSort(k, 0, 9);for(int i=0; i<10; i++)cout << k[i] <<"";cout<< endl;return 0;}递归//递归是选择结构，迭代是循环结构#include <iostream>using namespace std;long JieCheng(int n){if(n == 0)return 1;elsereturn n*JieCheng(n-1);}int main(){cout << JieCheng(5) << endl;return 0;}递归折半查找//递归是选择结构，迭代是循环结构//递归折半查找#include <iostream>using namespace std;int BinarySearch_I(int *a, const int x, const int n);int BinarySearch_R(int *a, const int x, const int left, const int right);int main(){int m[] = {1,2,3,4,5,6,7,8,9};int result;int num = 7;result = BinarySearch_R(m, num, 0, 8);if(result == -1)cout <<"can't find the element"<< endl;elsecout <<"在a["<<result <<"]中"<<"找到元素"<< num << endl;return 0;}//迭代二分查找int BinarySearch_I(int *a, const int x, const int n){int left, right;left = 0, right = n-1;while(left <= right){int middle = (left+right)/2;if(a[middle] == x)return middle;else if(a[middle] < x)left = middle+1;else if(a[middle] > x)right = middle -1;}return -1;}//递归二分查找int BinarySearch_R(int *a, const int x, const int left ,const int right){if(left <= right){int middle = (left+right)/2;if(x < a[middle])return BinarySearch_R(a, x, left, middle-1 );else if(x > a[middle])return BinarySearch_R(a, x, middle+1, right);elsereturn middle;}return -1;}组合排序//排列组合Permutations#include <iostream>using namespace std;int c1 = 0, c2 = 0;void show(char *p, int m){for(int i=0; i<=m; i++)cout << p[i];cout << endl;}//递归函数void Permutation(char *p, const int k , const int m){//a开头的，后面跟着bc的所有排列swap(p[0], p[0]);//便于理解，自己和自己交换Permutation(p, 1, 2);swap(p[0], p[0]);//b开头的，后面跟着ac的所有排列swap(p[0], p[1]);Permutation(p, 1, 2);//c开头的，后面跟着ab的所有排列swap(p[0], p[2]);Permutation(p, 1, 2);swap(p[0],p[2]);}//理解版本—下面的★三行便可替换掉上面代码void Permutations(char *p, const int k, const int m){cout <<"c1 = "<< ++c1 << endl;//调用次数统计if(k == m){for(int i=0; i<=m; i++)cout << p[i];cout << endl;}else{for(int i=k; i <= m; i++){cout <<"递归前，交换前:" ;show(p, m);★swap(p[k], p[i]);cout <<"递归前，交换后:";show(p, m);★Permutations(p, k+1, m);cout <<"c2 ="<< ++c2 <<endl;★swap(p[k], p[i]);//还原之前的顺序cout <<"递归后，交换后:";show(p, m);}}}int main(){char s[] = "abc";Permutations(s,0,2);cout << endl;return 0;} 插入排序#include <iostream>using namespace std;template <class T>void InsertionSort(T *a, int n);template <class T>void InsertionSort_2(T *a, int n);int main(){double x[] = {22,2.3,6.6,8,0,1,3,5,7,9};int y[] = {0,2,4,6,8,0,1,3,5,7,9};InsertionSort(x, 10);InsertionSort_2(y, 10);for(int i=0; i<10; i++){cout << x[i] <<"" ;}cout << endl;for(int i=1; i<=10; i++){cout << y[i] <<"" ;}return 0;}template <class T>void InsertionSort(T *a, int n){int in, out;//in表示已经出去的人，out 表示即将出去的人。