Dylan_min

//快速排序 #include using namespace std; #include //计算排序时间 typedef int T; void sort (T a[], int n)//(T* a, int n) { if(n<=1) return; swap(*a, a[n>>1]); T* L=a+1; T* R=a+n-1; T v=*a; while(L<R) {

#include using namespace std; //链表的定义 typedef int T; class List { struct Node { T data; Node* next; Node (const T & t=T()):data(t) {next=NULL;} }; Node* head; public : List(): head (NULL) {} void cle

#include #include struct node { int data; struct node *m_pNext; }; typedef struct node * PNode;//PNode相当于node* /*递归版 PNode reverseList(PNode head) { if(head == NULL || head->m_pNext =

#include #include const int N=20; char s1[N], s2[N], ans[N]; void build(int n, char* s1, char* s2, char* s) { if(n <= 0) return; int p = strchr(s2, s1[0]) - s2;//strchr----找到s1[0]在s2中的位置 build(p,

#include int Partition(int *iArray, int i, int j) { int pivot = iArray[ i ]; while(i < j) { while(i = pivot ) { j --; } if(i < j) { iArray[ i ++ ] = iArray[ j ]; } while(i