摘要： 1 #include 2 using namespace std; 3 4 5 int Binary_search(int *a, int p, int r, int x) 6 { 7 if (p > r) 8 return false; 9 int midpoint = (p + r) / 2; 10 if (a[midpoint]... 阅读全文

摘要： 1 #include 2 #include 3 using namespace std; 4 5 #define MAXSIZE 10 6 struct quene 7 { 8 int count; 9 int number[MAXSIZE]; 10 int front; 11 int end; 12 }; 13 14 15 void in... 阅读全文

摘要： 1 #include 2 #include 3 using namespace std; 4 5 #define MAXSIZE 10 6 struct quene 7 { 8 int count; 9 int number[MAXSIZE]; 10 int front; 11 int end; 12 }; 13 14 15 void in... 阅读全文

摘要： #include<iostream>#include<ctime>using namespace std; struct node{ int number; node *next;}; struct quene{ int count; node *front; node *end;}; void i 阅读全文

摘要： 1 #include 2 #include 3 using namespace std; 4 5 struct linknode 6 { 7 int number; 8 linknode *next; 9 }; 10 11 12 struct linkstack 13 { 14 int count; 15 linknode *top; 16... 阅读全文

摘要： 1 #define MAXSIZE 100 2 3 struct doublestack 4 { 5 int number[MAXSIZE]; 6 int top1=-1; 7 int top2=MAXSIZE; 8 }; 9 10 11 void Push(doublestack *s, int e, int n) 12 { 13 //栈... 阅读全文

摘要： 1 #include 2 #include 3 using namespace std; 4 5 #define MAXSIZE 10 6 7 struct stack 8 { 9 int number[MAXSIZE]; 10 int top=-1; 11 }; 12 13 bool Push(stack *s, int e) 14 { 15 i... 阅读全文

摘要： 1 #include<iostream> 2 #include<ctime> 3 using namespace std; 4 5 struct list 6 { 7 int number; 8 list *prior; 9 list *next; 10 }; 11 12 13 int FindLi 阅读全文

摘要： #include<iostream>#include<ctime>using namespace std; struct list{ int number; list *next;}; int FindLinkList(list *t, int i){ int j = 0; list *p = t; 阅读全文