diff --git "a/\345\256\236\351\252\214\344\270\200/CPP/1817022-\345\256\236\351\252\2141.cpp" "b/\345\256\236\351\252\214\344\270\200/CPP/1817022-\345\256\236\351\252\2141.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..c933c440cb2f2ce6a63ac3a3c65809659a8215ae
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\270\200/CPP/1817022-\345\256\236\351\252\2141.cpp"
@@ -0,0 +1,49 @@
+#include <iostream>
+
+using namespace std;
+
+void Qsort(int arr[], int low, int high) {
+	if (high <= low) return;
+	int i = low;
+	int j = high + 1;
+	int key = arr[low];
+	while (true)
+	{
+		while (arr[++i] < key)
+		{
+			if (i == high) {
+				break;
+			}
+		}
+		while (arr[--j] > key)
+		{
+			if (j == low) {
+				break;
+			}
+		}
+		if (i >= j) break;
+		int temp = arr[i];
+		arr[i] = arr[j];
+		arr[j] = temp;
+	}
+	int temp = arr[low];
+	arr[low] = arr[j];
+	arr[j] = temp;
+	Qsort(arr, low, j - 1);
+	Qsort(arr, j + 1, high);
+}
+
+int main()
+{
+	int a[10];  
+	for (int 
+		i = 0; i < 10; i++)
+	{
+		cin >> a[i];
+	}
+	Qsort(a, 0, sizeof(a) / sizeof(a[0]) - 1);
+	for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++)
+	{
+		cout << a[i] << " ";
+	}
+}
diff --git "a/\345\256\236\351\252\214\344\270\200/HTML/1817022-1.html" "b/\345\256\236\351\252\214\344\270\200/HTML/1817022-1.html"
new file mode 100644
index 0000000000000000000000000000000000000000..3a8e9d044e7748b93ae480cbde46461972153968
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\270\200/HTML/1817022-1.html"
@@ -0,0 +1,54 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+    <script>
+        export default (arr)=>{
+    function maximumItemSum(array,leftest,rightest){
+    //递归只剩下一项
+    if(leftest == rightest) {  
+      return array[rightest]>0?array[rightest]:0
+    }else{
+      let middle = Math.floor((leftest+rightest)*0.5); //相除之后向下取整,求得中间分割线
+      //左侧的最大子序列  
+      let maxLeftSum = maximumItemSum(arr, leftest, middle);  
+      //右侧的最大子序列
+      let maxRightSum = maximumItemSum(arr, middle+1, rightest);  
+
+      //中线左边求和。
+      let sumLeftTmp = 0; //暂存左边累加的结果
+      let maxBorderLeft = 0;  //用于存储分割线左边和的最大值
+      for(let i=middle;i>=leftest;i--){
+        sumLeftTmp +=array[i];
+        if(sumLeftTmp>maxBorderLeft){
+          maxBorderLeft = sumLeftTmp;
+        }
+      }
+
+      //中线右边求和。
+      let sumRightTmp = 0;//暂存右边累加的结果
+      let maxBorderRight = 0; //用于存储分割线右边的最大值
+      for(let j=middle+1;j<=rightest;j++){
+        sumRightTmp +=array[j];
+        if(sumRightTmp>maxBorderRight){
+          maxBorderRight =sumRightTmp;
+        }
+      }
+
+      //取出最大的值
+      let maxSum = Math.max(maxLeftSum,maxRightSum,maxBorderLeft+maxBorderRight);
+      return maxSum
+    }      
+  }
+  console.log('maxSum:',maximumItemSum(arr,0,arr.length-1));
+  return maximumItemSum(arr,0,arr.length-1);
+}
+    </script>
+</head>
+<body>
+    <div>输入:-2,11,-4,13,-5,-2</div>
+    <div>输出：20</div>
+</body>
+</html>
\ No newline at end of file
diff --git "a/\345\256\236\351\252\214\344\270\200/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-1.doc" "b/\345\256\236\351\252\214\344\270\200/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-1.doc"
new file mode 100644
index 0000000000000000000000000000000000000000..18f3d4cd39fabf939c8c6f27ef3efc8973e4115c
Binary files /dev/null and "b/\345\256\236\351\252\214\344\270\200/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-1.doc" differ
diff --git "a/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/.keep" "b/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/.keep"
new file mode 100644
index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391
diff --git "a/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/1817022/.keep" "b/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/1817022/.keep"
new file mode 100644
index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391
diff --git "a/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/1817022/1817022-1.cpp" "b/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/1817022/1817022-1.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..21a7bba1321464eebdbb8f6e4f0c3aec980623cb
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\270\200/\350\256\272\346\226\207\351\252\214\350\257\201\347\250\213\345\272\217/1817022/1817022-1.cpp"
@@ -0,0 +1,201 @@
+#include<iostream>
+#include <stdio.h>
+#include<time.h>
+#include<math.h>
+#include<stdlib.h>
+#define N 10 
+using namespace std;
+string isright(int *arr,int n)
+{
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]>arr[i+1]){
+		return "false";break;}
+		else return "true";
+	}
+}
+//���ذ� 
+    void quickSort(int *arr,int left,int right)  
+    {
+    	if (left >= right) return; 
+    	int le= left;
+    	int ri= right;
+    	int key = arr[left]; 
+    	while (le<ri)   
+    	{
+    		while (le<ri && arr[ri] >= key)
+    		{	
+    			ri--;	
+    		}
+    		arr[le] = arr[ri];
+    		while (le<ri&& arr[le] <= key)
+    		{
+    			le++;
+    		}
+    		arr[ri] = arr[le];
+    	}
+    	arr[le] = key; 
+     
+    	quickSort(arr,left,le- 1);
+    	quickSort(arr,le+1,right);
+    	
+    }
+    void quick_sort(int *arr, int len)
+    {	
+    	quickSort(arr,0,len-1);	
+    }
+
+//������ֵ��
+int partition(int *a,int p,int r){
+    //ѡȡһ����׼�� 
+    int midIndex= p+((r-p)>>1);//�м��±�
+    int midValue=-1;//�м�ֵ�±�
+    if(a[p]<=a[midIndex]&&a[p]>=a[r]) midValue=p;
+    else if(a[r]<=a[midIndex]&&a[r]>=a[p]) midValue=r;
+    else midValue=midIndex;
+    swap(a[midValue],a[p]);
+    
+    int x=a[p];//��׼��
+    int l=p+1,q=r;
+    while(l<=q){
+        while(a[l]<=x&&l<=q) ++l;
+        while(a[q]>x&&l<=q) --q;
+        if(l<=q) swap(a[l],a[q]);
+     }
+     swap(a[p],a[q]);
+     return q;
+} 
+void partition1(int *a,int n)
+{
+	partition(a,0,n-1);
+}
+
+//������ֵ��
+void insertsort(int a[],int p,int q){//�������� 
+    int temp;
+    for(int i=p;i<=q;i++){
+        if(a[i]<a[i-1]){
+            temp=a[i];
+            for(int j=i;j>=0;j--){
+                if(j>0&&a[j-1]>temp) a[j]=a[j-1];
+                else {
+                    a[j]=temp;
+                    break;
+                }
+            }
+        }
+    }
+}
+int getmid(int a[],int p,int r){
+    int length=r-p+1;
+    int grouplength=(length%5==0)?(length/5):(length/5+1);//ÿ���Ԫ��һ�飬�õ����ֵĸ��� 
+    int *medians=new int[grouplength];//����洢�м�ֵ������
+    int midIndex=0;
+    for(int i=0;i<grouplength;i++){
+        if(i==grouplength-1){//���һ��ʱ ,��Ҫ������������Ϊ������Ԫ�ظ���С��5�� 
+            insertsort(a,p+i*5,r);//���ò������� 
+            medians[midIndex++]=a[(p+i*5+r)/2];//�������� 
+        }else {
+            insertsort(a,p+i*5,p+i*5+4);
+            medians[midIndex++]=a[(p+i*5+2)];
+        }
+    } 
+    insertsort(medians,0,grouplength-1);
+    return medians[grouplength/2];
+}
+void insertso(int *a,int n)
+{
+	getmid(a,0,n-1);
+ } 
+ 
+ //+ֱ�Ӳ������� 
+ void quicksort(int a[],int l,int r){//���ŵݹ���ʽ 
+    if(l<r){
+        if((r-l+1)<=8) insertsort(a,l,r);//���ò�������
+        else{
+            int q=partition(a,l,r);//�ҵ��м���,��һ������λ�� 
+            quicksort(a,l,q-1);
+            quicksort(a,q+1,r);            
+        } 
+    }
+}
+void quick(int *a,int n)
+{
+	quicksort(a,0,n-1);
+}
+int main()
+{int i=0;
+    int arr[N];
+    for(i=0;i<N;i++)
+    {
+    	arr[i]=rand()%300 ;
+	}cout<<"�����ʼ���飺";
+	for(int j=0;j<N;j++)
+	{
+		cout<<arr[j]<<" ";
+	}cout<<endl<<endl;
+	int times1,times2,times3,times4;
+	time_t start1,end1;double Time1;
+	start1=(double)clock();
+	quick_sort(arr,N);
+	times1=(double)clock();
+
+   	for(i=0;i<N;i++)
+   	 {
+   	  cout<<arr[i]<<" "; 
+  	 }
+  	 end1=(double)clock();
+	 cout<<endl<<"��֤�����"<<isright(arr,N);
+	 Time1=(double)(end1-start1)/CLK_TCK;
+  	 cout<<endl<<"��ͨ����ʹ��ʱ�䣺"<<Time1<<endl;
+  	 cout<<"�Ƚϴ�����"<<times1<<endl;
+  	//f��2 
+  	cout<<endl;
+  	 time_t start2,end2;double Time2;
+  	  start2=(double)clock();
+  	  partition1(arr,N);
+  	  times2=(double)clock();
+  	     	for(i=0;i<N;i++)
+   	 {
+   	  cout<<arr[i]<<" "; 
+  	 }
+  	 end2=(double)clock();
+  	 cout<<endl<<"��֤�����"<<isright(arr,N);
+	 Time2=(double)(end2-start2)/CLK_TCK;
+  	 cout<<endl<<"������ֵ������ʹ��ʱ�䣺"<<Time2<<endl;
+  	 cout<<"�Ƚϴ�����"<<times2<<endl;	 
+  	 
+	   //f��3
+	cout<<endl;
+	  time_t start3,end3;double Time3;
+  	  start3=(double)clock();
+  	  insertso(arr,N);
+  	  times3=(double)clock();
+  	     	for(i=0;i<N;i++)
+   	 {
+   	  cout<<arr[i]<<" "; 
+  	 }
+  	 end3=(double)clock();
+  	 cout<<endl<<"��֤�����"<<isright(arr,N);
+	 Time3=(double)(end3-start3)/CLK_TCK;
+  	 cout<<endl<<"������ֵ������ʹ��ʱ�䣺"<<Time3<<endl;
+  	 cout<<"�Ƚϴ�����"<<times3<<endl; 
+  	 
+  	 
+  	 //f��4
+	  cout<<endl; 
+	  time_t start4,end4;double Time4;
+  	  start4=(double)clock();
+  	  quick(arr,N);
+  	  times4=(double)clock();
+  	     	for(i=0;i<N;i++)
+   	 {
+   	  cout<<arr[i]<<" "; 
+  	 }
+  	 end4=(double)clock();
+  	 cout<<endl<<"��֤�����"<<isright(arr,N);
+	 Time4=(double)(end4-start4)/CLK_TCK;
+  	 cout<<endl<<"����+ֱ��ʹ��ʱ�䣺"<<Time4<<endl;
+  	 cout<<"�Ƚϴ�����"<<times4<<endl; 
+   return 0;	
+}
diff --git "a/\345\256\236\351\252\214\344\270\211/CPP/1817022-\345\256\236\351\252\2143.cpp" "b/\345\256\236\351\252\214\344\270\211/CPP/1817022-\345\256\236\351\252\2143.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..6a0b7d85edb5a3f062d681a1af8288032019c325
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\270\211/CPP/1817022-\345\256\236\351\252\2143.cpp"
@@ -0,0 +1,76 @@
+#include<bits/stdc++.h>
+using namespace std;
+int dst[5010];
+int n,m;
+bool s[5010];
+int pre[5010];
+struct node
+{
+    int v,w;
+    node(){}
+    node(int vv,int ww)
+    {
+        v=vv,w=ww;
+    }
+};
+vector<node> g[5010];
+void init()
+{
+    for(int i=1;i<=5000;i++)
+    {
+        dst[i]=0x7f7f7f7f;
+    }
+}
+int main()
+{
+    init();
+    int a,b,c;
+    cin>>n>>m;
+    for(int i=1;i<=m;i++)
+    {
+        cin>>a>>b>>c;
+        g[a].push_back(node(b,c));
+        g[b].push_back(node(a,c));
+    }
+    s[1]=1;
+    dst[1]=0;
+    int lasti=1;
+    for(int k=1;k<n;k++)
+    {
+        for(int j=0;j<g[lasti].size();j++)
+        {
+            int v=g[lasti][j].v,w=g[lasti][j].w;
+            if(!s[v]&&w<dst[v])
+            {
+                pre[v]=lasti;
+                dst[v]=w;
+                //dst[v]+=dst[pre[v]];
+            }
+        }
+        int min_i=0x7f7f7f7f,min_dst=0x7f7f7f7f;
+        for(int i=1;i<=n;i++)
+        {
+            if(!s[i])
+            {
+                if(dst[i]<min_dst)
+                {
+                    min_dst=dst[i];
+                    min_i=i;
+                }
+            }
+        }
+        lasti=min_i;
+        s[min_i]=1;
+        printf("���µ�%d���룬���ڵ�%d\n",lasti,pre[lasti]);
+    }
+     
+     
+    int total=0;
+    for(int i=1;i<=n;i++)
+    {
+        total+=dst[i];
+        printf("pre[%d]=%d\n",i,pre[i]); 
+    }
+    cout<<total<<endl;
+    return 0;
+}
diff --git "a/\345\256\236\351\252\214\344\270\211/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-3.doc" "b/\345\256\236\351\252\214\344\270\211/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-3.doc"
new file mode 100644
index 0000000000000000000000000000000000000000..a2ff61cfffbcfe9ca4dad1669a934de2e83fd74a
Binary files /dev/null and "b/\345\256\236\351\252\214\344\270\211/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-3.doc" differ
diff --git "a/\345\256\236\351\252\214\344\272\214/CPP/1817022-\345\256\236\351\252\2142.cpp" "b/\345\256\236\351\252\214\344\272\214/CPP/1817022-\345\256\236\351\252\2142.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..eb408b785da7e84f8f683f125a052f3ea32faf87
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\272\214/CPP/1817022-\345\256\236\351\252\2142.cpp"
@@ -0,0 +1,55 @@
+#include <iostream>
+#include<cstdio>
+
+using namespace std;
+
+#define N 100
+
+struct goods{
+int sign;//��Ʒ���
+int wight;//��Ʒ����
+int value;//��Ʒ��ֵ
+};
+
+int n,bestValue,cv,cw,C;//��Ʒ��������ֵ��󣬵�ǰ��ֵ����ǰ��������������
+int X[N],cx[N];//���մ洢״̬����ǰ�洢״̬
+struct goods goods[N];
+
+int Force(int i){
+if(i>n-1){
+    if(bestValue < cv && cw + goods[i].wight <= C){
+        for(int k=0;k<n;k++)
+            X[k] = cx[k];//�洢����·��
+        bestValue = cv;
+    }
+    return bestValue;
+}
+cw = cw + goods[i].wight;
+cv = cv + goods[i].value;
+cx[i] = 1;//װ�뱳��
+Force(i+1);
+cw = cw-goods[i].wight;
+cv = cv-goods[i].value;
+cx[i] = 0;//��װ�뱳��
+Force(i+1);
+return bestValue;
+}
+
+int main()
+{
+    printf("��Ʒ����n��");
+    scanf("%d",&n);
+    printf("��������C��");
+    scanf("%d",&C);
+    for(int i=0;i<n;i++){
+        printf("��Ʒ%d������w[%d]�����ֵv[%d]��",i+1,i+1,i+1);
+        scanf("%d%d",&goods[i].wight,&goods[i].value);
+    }
+    int sum1 = Force(0);
+    printf("���������0/1�������⣺\nX=[");
+    for(int i=0;i<n;i++){
+        cout << X[i]<<" ";
+        }
+        printf("] װ���ܼ�ֵ%d\n",sum1);
+    return 0;
+}
diff --git "a/\345\256\236\351\252\214\344\272\214/HTML/1817022-2.html" "b/\345\256\236\351\252\214\344\272\214/HTML/1817022-2.html"
new file mode 100644
index 0000000000000000000000000000000000000000..df57fcf1844fea91c344873b5f5b88bd15e0dafa
--- /dev/null
+++ "b/\345\256\236\351\252\214\344\272\214/HTML/1817022-2.html"
@@ -0,0 +1,61 @@
+<!doctype html>
+<html lang="en">
+ <head>
+  <meta charset="UTF-8">
+  <meta name="Generator" content="EditPlus®">
+  <meta name="Author" content="">
+  <meta name="Keywords" content="">
+  <meta name="Description" content="">
+  <title>递归</title>
+ <style type="text/css">
+     </style>
+     <script type="text/javascript">
+
+	  function kanpSack(capacity, weights, values, n) {
+  var a,b,KS = []
+   
+//首先，初始化用于寻找解决方案的矩阵KS[n+1][capacity+1]
+  for (var i = 0; i <= n; i++) {
+    KS[i] = [];
+  }
+  for (var i = 0; i <= n; i++) {
+    for (var w = 0; w <= capacity; w++) {
+      if (i === 0 || w === 0) {
+      //让第一行和第一列为0，因为第一行和第一列表示容量为0或没有物品可装
+        KS[i][w] = 0; 
+      } else if (weights[i - 1] > w) {
+        KS[i][w] = KS[i - 1][w]; //当前物品重量大于当前容量
+      } else {
+       //当前物品重量小于当前容量，有两个选择，装或者不装，取价值最大的
+        a = KS[i - 1][w - weights[i - 1]] + values[i - 1]; //装入这个物品后的总价值
+        b = KS[i - 1][w]; //不装
+  
+        KS[i][w] = a > b ? a : b;
+      }
+    }
+     
+  }
+  return KS[n][capacity];
+}
+function changelabel(){
+        document.getElementById("shuchu").innerText="............";}
+
+     </script>
+ </head>
+ <body>
+ <header>
+     <h1>递归“0-1背包问题”</h1><br /> <br /> <br />
+	 输入物品个数<input type="text" id="num" size="15" /></br>
+	 输入物品价值<input type="text" id="value" size="15" /></br>
+	 <input type="button" id="jisuan" value="点击计算最优值" onclick="changelabel()" /></br>
+	 &emsp;&emsp;&emsp;<label id="shuchu"  width:200px; ></label>
+ </header>
+
+ 
+ <footer>
+ <br/>
+ <br/>
+ <br/>
+ </footer>
+ </body>
+ </html>
\ No newline at end of file
diff --git "a/\345\256\236\351\252\214\344\272\214/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-2.doc" "b/\345\256\236\351\252\214\344\272\214/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-2.doc"
new file mode 100644
index 0000000000000000000000000000000000000000..82546734307f43b45571f6ba43ee16220a25e7aa
Binary files /dev/null and "b/\345\256\236\351\252\214\344\272\214/\345\256\236\351\252\214\346\212\245\345\221\212/1817022-2.doc" differ
