yanxiaopan的博客

方法一：非递归的方法#include<stdio.h>#include<stdlib.h>int binary_s(int a[], int len, int k){ int low = 0; int high = len - 1; while (low <= high) { int mid = (low + high) / 2;

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;void swap(int&a, int&b){ int c; c = a; a = b; b = c;}//希尔排序法，就是将数据分组后进行排序，分组后可用直接插入排序、选择排序、冒泡排序等。voi

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;void swap(int &a, int &b){ int c; c = a; a = b; b = c;}void bubble_sort(int a[], int n){ printf("

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;void swap(int &a, int &b){ int c; c = a; a = b; b = c;}void select_sort(int a[], int n){ printf("

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;void swap(int &a, int &b){ int c; c = a; a = b; b = c;}void insert_sort(int a[], int n){ printf("

折半查找-非递归方法：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;int zhebanfind(int a[], int n, int item){ int min = 0; int max = n - 1; int mid; while (min<=max)

代码程序：#include"stdio.h"#include<iostream>#include"stdlib.h"using namespace std;#define maxsize 10typedef struct{ int*elem; int length; int listsize;}sqlist;void initiallist(sqlist *l)

程序代码：#include"stdio.h"#include<iostream>#include"stdlib.h"using namespace std;#define maxsize 10void insertelem(int sqlist[], int &n, int i, int item)//向长度为n的静态顺序表的第i个位置处插入元素item{ if (n == max

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;typedef struct node{//定义链表中的一个结点 int adj; struct node*next;}arcnode;typedef struct vnode{//定义顶点类型 int data

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;typedef struct node{//定义一个二叉树结点 int data; struct node*lchild, *rchild;}binode,*bitree;void creatbitree(bitree*t

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;typedef struct node{//定义一个队列，由链表构成的队列 int data; struct node*next;}lnode,*listptr;typedef struct{ listptr fr

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;#define STACK_INIT_SIZE 100#define STACKINCREMENT 10typedef struct{//定义一个栈 int*base; int*top; int stacksiz

程序代码：#include"stdio.h"#include"stdlib.h"#include<iostream>using namespace std;typedef struct node{//定义链表结点 int data; struct node*next;}lnode,*listptr;listptr generatelist(int n)//生成一个长度为n的链

#include<stdlib.h>#include<stdio.h>int partion(int a[], int low, int high){ int pivot = a[low]; while (low < high) { while (low<high&&a[high]>=pivot) high--; a[low] = a[hi

#include<stdio.h>#include<stdlib.h>void swap(int&a, int&b){ int c; c = a; a = b; b = c;}int bubble_sort(int a[], int len){ int flag; for(int i = 0; i < len - 1; i++) {

http://www.cnblogs.com/zhonghuasong/p/7493475.htmlhttp://mp.weixin.qq.com/s?__biz=MzIzMjQyNzQ5MA==&mid=2247484927&idx=1&sn=f6b7c0bba3268bcf994d2befed5af1f7&chksm=e8945f72dfe3d6644961d4dc3641c269ce3085f