diff --git a/Test.cpp b/Test.cpp
new file mode 100644
index 0000000..96b5f9c
--- /dev/null
+++ b/Test.cpp
@@ -0,0 +1,140 @@
+//#include<stdio.h>
+//
+//void paixu(int n, int a[]) { //n为数组的元素个数
+//	for (int i = 0; i < n - 1; i++) {
+//		//TODO
+//		for (int j = i + 1; j < n; j++) {
+//			//TODO
+//			if (a[i] > a[j]) {
+//				int t = a[i];
+//				a[i] = a[j];
+//				a[j] = t;
+//			}
+//		}
+//
+//	}
+//	for (int i = 0; i < n; i++) {
+//		//TODO
+//		printf("%d", a[i]);
+//	}
+//}
+
+//int main() {
+//	int a[5] = {8, 6, 5, 4, 1};
+//	paixu(5, a);
+//}
+
+//#include<stdio.h>
+//int main() {
+//	int min, div, m, n, i = 2;
+//	printf("请输入两个数:\n");
+//	scanf("%d %d", &m, &n);
+//	if (m > n)
+//		min = n;
+//	else
+//		min = m;
+//	for (i; i <= min; i++) {
+//		if (m % i == 0 && n % i == 0) {
+//			div = i;
+//		}
+//	}
+//	printf("最大公约数为%d\n", div);
+//	return 0;
+//}
+//
+//#include <stdio.h>
+//
+//int main() {
+//	int n1, n2, i, gcd;
+//
+//	printf("输入两个正整数");
+//	scanf("%d %d", &n1, &n2);
+//
+//	for (i = 1; i <= n1 && i <= n2; ++i) {
+//		// 判断 i 是否为最大公约数
+//		if (n1 % i == 0 && n2 % i == 0)
+//			gcd = i;
+//	}
+//
+//	printf("%d 和 %d 的最大公约数是 %d", n1, n2, gcd);
+//
+//	return 0;
+//}
+
+
+//#include <stdio.h>
+//int main()
+//{
+//	int a[11]={1,2,3,4,5,7,8,9,10,11};
+//	int i,t,m;
+//	printf("输入一个数:\n");
+//	scanf("%d",&m);
+//	for(i=0;i<11;i++)
+//	{
+//		if(m<a[i])
+//		{
+//			t=m;m=a[i];a[i]=t;
+//		}
+//		else if(m>a[9])
+//			a[10]=m;
+//	}
+//	printf("排序后:\n");
+//	for(i=0;i<11;i++)
+//		printf("%d ",a[i]);
+//	return 0;
+//}
+
+
+//#include<stdio.h>
+//#include<math.h>
+//
+//int main() {
+//	double r, s ;
+//	printf("半径:");
+//	scanf("%lf", &r);
+//	s = (3 * 3.1415926 * r * r) / 4;
+//	printf("s=%lf", s);
+//}
+
+//#include <stdio.h>
+//#include <math.h>
+//main() {
+//	int n, i, k;
+//	for (n = 100; n > 0; n--) {
+//		k = sqrt(n);
+//		for (i = 2; i <= k; i++)
+//			if (n % i == 0)
+//				break;
+//		if (i > k) {
+//			printf("%d\n", n);
+//			break;
+//		}
+//	}
+//}
+
+#include <stdio.h>
+
+int gcd(int m, int n) {
+	int div, i, min;
+	if (m < n) {
+		min = m;
+	} else {
+		min = n;
+	}
+	for (i = 2; i <= min; i++) {
+		if (m % i == 0 && n % i == 0) {
+			div = i;
+		}
+	}
+	return div;
+}
+
+int main() {
+	int m, n;
+	printf("请输入两个整数：\n");
+	scanf("%d %d", &m, &n);
+	int result = gcd(m, n);
+	printf("%d和%d的最大公约数是%d\n", m, n, result);
+	return 0;
+}
+
diff --git a/计算机组成原理实验代码/Best_Bad_Fit.cpp b/计算机组成原理实验代码/Best_Bad_Fit.cpp
new file mode 100644
index 0000000..a7f6aac
--- /dev/null
+++ b/计算机组成原理实验代码/Best_Bad_Fit.cpp
@@ -0,0 +1,430 @@
+#include<stdio.h>
+#include<stdlib.h>
+#define N 5
+#include<iostream>
+using namespace std;
+enum STATE 
+{ 
+F,W 
+};
+ 
+struct subAreaNode 
+{
+	int addr;              // ��ʼ��ַ
+	int size;              // ������С
+	int taskId;            // ��ҵ��
+	STATE state;             // ����״̬
+	subAreaNode *pre;     // ����ǰ��ָ��
+	subAreaNode *nxt;       // ��������ָ��
+}subHead;
+ 
+
+struct  PCB
+{
+	char name[8];  //������ 
+	int  arrive_time;  //����ʱ�� 
+	int  run_time;   //����ʱ�� 
+    int finish_time;   //���ʱ�� 
+	int  zhouzhuan_time;   //��תʱ�� 
+	float daiquan_time;   //��Ȩ��תʱ�� 
+};
+
+float sumzhouzhuantime,sumdaiquanzhouzhuantime;
+struct PCB pcb[N],temp;
+
+void input();  //�������
+void sort();      //������Ľ��̰�����ʱ���������ִ��
+void output();   //����㷨����ʱ���
+
+ 
+ 
+// ��ʼ�����з�����
+void intSubArea()
+{
+	// �����ʼ�����ڴ�
+	subAreaNode *fir = (subAreaNode *)malloc(sizeof(subAreaNode));
+	// ���׸�������ֵ
+	fir->addr = 0;
+	fir->size = 1000;     // �ڴ��ʼ��С
+	fir->state = F;
+	fir->taskId = -1;
+	fir->pre = &subHead;
+	fir->nxt = NULL;
+	// ��ʼ������ͷ����Ϣ
+	subHead.pre = NULL;
+	subHead.nxt = fir;
+}
+ 
+
+// �����Ӧ�㷨
+int BestFit(int taskId, int size)
+{
+subAreaNode *tar = NULL;
+int tarSize = 1000 + 1;
+subAreaNode *p = subHead.nxt;
+while (p != NULL)
+{
+// Ѱ����ѿ�������
+if (p->state == F && p->size >= size && p->size < tarSize) {
+tar = p;
+tarSize = p->size;
+}
+p = p->nxt;
+}
+if (tar != NULL) {
+// �ҵ�Ҫ����Ŀ��з���
+if (tar->size - size <= 10)
+{
+// �������
+tar->state = W;
+tar->taskId = taskId;
+}
+else
+{
+// �����СΪsize������
+subAreaNode *node = (subAreaNode *)malloc(sizeof(subAreaNode));
+node->addr = tar->addr + size;
+node->size = tar->size - size;
+node->state = F;
+node->taskId = -1;
+// �޸ķ������ڵ�ָ��
+node->pre = tar;
+node->nxt = tar->nxt;
+if (tar->nxt != NULL) 
+{
+tar->nxt->pre = node;
+}
+tar->nxt = node;
+// �����������
+tar->size = size;
+tar->state = W;
+tar->taskId = taskId;
+}
+printf("�ڴ����ɹ���\n");
+return 1;
+}
+else
+{
+printf("�Ҳ������ʵ��ڴ����������ʧ��...\n");
+return 0;
+}
+}
+
+
+
+
+void BadFit(int taskId,int size){  //���Ӧ 
+	//��ѿ�ָ�� 
+	struct subAreaNode *q = NULL;
+	subAreaNode *node = subHead.nxt;
+	//�����ҵ���һ�����������Ŀ��п� 
+	while(node != NULL){
+		if(node->state == F && node->size >= size){
+			q = node;
+			break;
+		}
+		//�����һ��Ϊ����˵��û�п��������Է��� 
+		if(node->nxt == NULL){
+			printf("����ʧ�ܣ�û���㹻�Ŀռ䣡\n");
+			break;
+		} else{
+			node = node->nxt;	
+		}
+		
+	} 
+	//����Ѱ����ѵĿ��п� 
+	while(node != NULL){
+		if(node->state == F && node->size >= size && node->size < q->size){  //���еĿռ� 
+			q = node;
+		}
+		node = node->nxt;
+	}
+	if(q->size < size){  			//��ѿ��п�Ĵ�СС�������С 
+		//�����ʣ��Ŀռ� 
+		struct subAreaNode *p = (struct subAreaNode*)malloc(sizeof(struct subAreaNode));
+		p->addr = q->addr + size;
+		p->size = q->size - size;
+		p->state = F;
+		p->taskId = -1;
+		//����Ŀռ� 
+		q->taskId = taskId; 
+		q->size = size;
+		q->state = W;
+		//�ı�ڵ������ 
+		p->nxt = q->nxt; 
+		q->nxt = p;
+	}else if(q->size == size){  	//��ѿ��п�ռ��С���������
+		q->taskId = taskId; 
+		q->size = size;
+		q->state = W;
+	}		
+}
+
+
+int freeSubArea(int taskId)     // �����ڴ�
+{
+int flag = 0;
+subAreaNode *p = subHead.nxt, *pp;
+while (p != NULL)
+{
+if (p->state == W && p->taskId == taskId)
+{
+flag = 1;
+if ((p->pre != &subHead && p->pre->state == F)
+&& (p->nxt != NULL && p->nxt->state == F))
+{
+// ���1���ϲ�������������
+// �Ⱥϲ�������
+pp = p;
+p = p->pre;
+p->size += pp->size;
+p->nxt = pp->nxt;
+pp->nxt->pre = p;
+free(pp);
+// ��ϲ�������
+pp = p->nxt;
+p->size += pp->size;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else if ((p->pre == &subHead || p->pre->state == W)
+&& (p->nxt != NULL && p->nxt->state == F)) 
+{
+// ���2��ֻ�ϲ�����ķ���
+pp = p->nxt;
+p->size += pp->size;
+p->state = F;
+p->taskId = -1;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else if ((p->pre != &subHead && p->pre->state == F)
+&& (p->nxt == NULL || p->nxt->state == W)) 
+{
+// ���3��ֻ�ϲ�����ķ���
+pp = p;
+p = p->pre;
+p->size += pp->size;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else
+{
+// ���4�����·��������úϲ�
+p->state = F;
+p->taskId = -1;
+}
+}
+p = p->nxt;
+}
+if (flag == 1)
+{
+// ���ճɹ�
+printf("�ڴ�������ճɹ�...\n");
+return 1;
+}
+else 
+{
+// �Ҳ���Ŀ����ҵ������ʧ��
+printf("�Ҳ���Ŀ����ҵ���ڴ��������ʧ��...\n");
+return 0;
+}
+}
+
+
+
+
+// ��ʾ���з��������
+void showSubArea()
+{
+	printf("\n");
+	printf("         ��ǰ���ڴ����������£�        \n");
+	printf("          W:����״̬ F:����״̬           \n");
+	printf("___________________________________________\n");
+	printf("| ��ʼ��ַ | �ռ��С | ����״̬ | ��ҵ�� |\n");
+	subAreaNode *p = subHead.nxt;
+	while (p != NULL)
+	{
+	printf("___________________________________________\n");
+	
+	printf("  %3d  k  |", p->addr);
+	printf("  %3d  k  |", p->size);
+	printf("   %s   |", p->state == F ? "F" : "W");
+	if (p->taskId > 0) 
+	{
+	printf("   %2d   ", p->taskId);
+	}
+	else
+	{
+	printf("        ");
+	}
+	printf("\n");
+	p = p->nxt;
+	}
+	printf("___________________________________________\n");
+}
+
+void sort() //���յ���ʱ��Խ��̽������� 
+{
+	for(int i=0;i<N-1;i++)
+	{
+		for(int j=i+1;j<N;j++)
+		{
+			if(pcb[i].arrive_time>pcb[j].arrive_time)
+			{
+				temp=pcb[i];
+				pcb[i]=pcb[j];
+				pcb[j]=temp;
+			}
+		}
+	} 
+}
+ 
+void  output(int j)
+{   
+	int i;
+	cout<<"����������Ϣ����(FCFS�����㷨):"<<endl;
+    	pcb[0].finish_time=pcb[0].arrive_time+pcb[0].run_time;
+     	pcb[0].zhouzhuan_time=pcb[0].finish_time-pcb[0].arrive_time;
+		pcb[0].daiquan_time=(float)pcb[0].zhouzhuan_time/pcb[0].run_time;
+  	for(i=1;i<j;i++)
+	{	 
+	 	if(pcb[i].arrive_time>pcb[i-1].finish_time)
+		{
+              pcb[i].finish_time=pcb[i].arrive_time+pcb[i].run_time;
+              pcb[i].zhouzhuan_time=pcb[i].run_time;
+              pcb[i].daiquan_time=(float)pcb[i].zhouzhuan_time/pcb[i].run_time;
+		}
+		else
+		{
+            pcb[i].finish_time=pcb[i-1].finish_time+pcb[i].run_time;
+            pcb[i].zhouzhuan_time=pcb[i].finish_time-pcb[i].arrive_time;
+			pcb[i].daiquan_time=(float)pcb[i].zhouzhuan_time/pcb[i].run_time;
+		}
+    	
+	}  
+
+	for(i=0;i<j;i++)
+		{
+			sumzhouzhuantime+=pcb[i].zhouzhuan_time;
+			sumdaiquanzhouzhuantime+=pcb[i].daiquan_time;
+		}
+
+    printf("****************************************************************\n");
+    printf("������   ����ʱ��  ����ʱ��  ���ʱ��  ��תʱ��    ��Ȩ��תʱ��  \n");
+	printf("****************************************************************\n");
+    for(i=0;i<j;i++)
+	{
+	  	printf(" %s        %d         %d         %d         %d         %.2f\n",pcb[i].name,pcb[i].arrive_time,pcb[i].run_time,pcb[i].finish_time,pcb[i].zhouzhuan_time,pcb[i].daiquan_time);
+
+	}
+	printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");
+	cout<<"ƽ����תʱ��:"<<sumzhouzhuantime/N<<endl;
+	cout<<"ƽ����Ȩ��תʱ��:"<<sumdaiquanzhouzhuantime/N<<endl;
+    printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");
+}
+ 
+ 
+void showProess(int j){
+	printf("����������Ϣ����:\n");
+	printf("������ ����ʱ�� ����ʱ��\n"); 
+	for(int i=0;i<j;i++)
+	{  	
+	printf("%s   \t",pcb[i].name);
+    printf("%d   \t",pcb[i].arrive_time);
+	printf("%d \n",pcb[i].run_time);
+    }
+} 
+
+int main()
+{
+	int  ope, taskId, size,select,count;
+	//oep ����ѡ�� taskId ���̺�   size ���̴�С   select �����㷨ѡ��  count ���� 
+	
+	// ��ʼ�����з�����
+	intSubArea();
+	printf(">>>>>>>>>>>>>>>>>>��̬�����㷨ģ��֮���/���Ӧ�㷨<<<<<<<<<<<<<<<<<<\n") ;
+	printf("                 ____________________________________\n");
+	printf("                 | 1: �����Ӧ�㷨  2: ���Ӧ�㷨  |\n");
+	printf("                 |___________________________________|\n");
+	printf("��ѡ������㷨:"); 
+	scanf("%d",&select); 
+	
+	// ģ�⶯̬���������㷨
+
+    for(int i=0;i<N;i++){
+	printf("   ________________________________________________________________\n");
+	printf("   | 1: �����ڴ�  2: �����ڴ�  3.�������   4.������Ϣ   0: �˳�   |\n");
+	printf("   |_______________________________________________________________|\n");
+	printf("��ѡ��ִ�еĹ���:");
+	scanf("%d", &ope);
+	if (ope == 0) break;
+	if (ope == 1) {
+
+	// ģ������ڴ�
+	printf("��������ҵ�ţ� ");
+	scanf("%d", &taskId);
+	
+	
+	printf("�����������:" );
+    scanf("%s",pcb[i].name);
+	printf("�����뵽��ʱ��:");
+	scanf("%d",&pcb[i].arrive_time);
+	printf("������Ҫ����ʱ��:");
+	scanf("%d",&pcb[i].run_time);	
+
+	printf("��������Ҫ������ڴ��С(KB)�� ");
+	scanf("%d", &size);
+	count+=1;
+//	showProess(count);
+	
+	if (size <= 0) 
+	{
+	printf("ERROR:�����ڴ��С����Ϊ��ֵ\n");
+	continue;
+	}
+	switch(select){  //�����㷨ѡ�� 
+		case 1:
+			BestFit(taskId,size); 
+			break ;
+		case 2:
+			BadFit(taskId,size);
+			break ;
+	}
+	}
+	else if (ope == 2)
+	{
+	// ģ������ڴ�
+	printf("������Ҫ���յ���ҵ�ţ� ");
+	scanf("%d", &taskId);
+	freeSubArea(taskId);
+	showSubArea();
+	}
+	else if(ope==3){
+		showSubArea(); // ��ʾ���з��������
+	} 
+	else if(ope==4){
+		showProess(count);
+		output(count);
+	} 
+	else 
+	{
+	printf("���������� 0/1/2\n");
+	}
+	}
+	printf("�����㷨ģ�����\n");
+	system("pause");
+	return 0;
+}
diff --git a/计算机组成原理实验代码/F.cpp b/计算机组成原理实验代码/F.cpp
new file mode 100644
index 0000000..9340cc5
--- /dev/null
+++ b/计算机组成原理实验代码/F.cpp
@@ -0,0 +1,15 @@
+//#include <stdio.h>
+//#include <iostream>
+//#include<iomanip>
+//using namespace std;
+//int main()
+//{
+//	
+//	double F,C;
+//	cin>>F; 
+//	C=(F-32)*5/9;
+//	cout <<setiosflags(ios::fixed)<<setprecision(2) << C;
+//    return 0;
+//}
+
+
diff --git a/计算机组成原理实验代码/FCFS.cpp b/计算机组成原理实验代码/FCFS.cpp
new file mode 100644
index 0000000..5f587ef
--- /dev/null
+++ b/计算机组成原理实验代码/FCFS.cpp
@@ -0,0 +1,91 @@
+#include <stdio.h>
+#define n 5
+struct JCB
+{
+    int name;          //������
+    int atime;         //���̵���ʱ��
+    int runtime;       //��������ʱ��
+    int ftime;         //�������ʱ��
+    int total;           //��תʱ��
+    float welght;        //��Ȩ��תʱ�䣨��תϵ����
+    int arun;          //���̵�������
+ 
+}f[n];
+
+
+//��ʼִ��ʱ�䣬����ҵ�����ʱ�䣬��תʱ��ʹ�Ȩ��תʱ�䣨��תϵ������
+int main()
+{
+    int amount;
+    int i,j,l,k,h;
+
+    struct  JCB f[n];
+
+    printf("��������̸���(2-24):\n");
+    scanf("%d",&amount);
+    for(i=0;i<amount;i++)
+    {
+        printf("����������������̵���ʱ�䣨0-30������������ʱ�䣨1-8��:\n");
+        scanf("%d",&f[i].name);
+        scanf("%d",&f[i].atime);
+        scanf("%d",&f[i].runtime);
+
+    }
+    printf("������\t���̵���ʱ��\t��������ʱ��\n");
+    for(i=0;i<amount;i++)
+    {
+        printf("%d\t%d\t\t%d\t\n",f[i].name,f[i].atime,f[i].runtime);
+    }
+    printf("------�����ȷ���FCFS�������㷨------\n");
+
+
+    for(i=0;i<amount-1;i++) //�����̵���ʱ����Ⱥ�����
+    {                               //�����������ͬʱ���������Ļ�������������
+        for(j=i+1;j<amount;j++)
+        { 
+            if(f[j].atime < f[i].atime)
+            {
+                l  =f[j].atime;            
+                h  =f[j].runtime;
+                k  =f[j].name;
+
+                f[j].atime      =f[i].atime;        
+                f[j].runtime    =f[i].runtime;
+                f[j].name       =f[i].name;
+
+                f[i].atime   =l;
+                f[i].runtime =h;
+                f[i].name    =k;
+            }
+        }
+    }
+    printf("�����̵���ʱ����Ⱥ�����\n\n");
+
+    printf("������\t���̵���ʱ��\t��������ʱ��\n");
+    for(i=0;i<amount;i++)
+    {
+        printf("%d\t%d\t\t%d\t\n",f[i].name,f[i].atime,f[i].runtime);
+    }
+
+    printf("������ ���̵��� ��ʼ���� �������� ���̽��� ��תʱ�� ��תϵ��\n");
+    f[0].arun=0;
+    for(i=0;i<amount;i++)
+    {
+        if(f[i].arun<f[i].atime)
+        {
+            f[i].arun =f[i].atime;
+        }
+
+        f[i].ftime=f[i].arun+f[i].runtime;
+        f[i].total=f[i].ftime-f[i].atime;
+        f[i].welght=(float)f[i].total/(float)f[i].runtime;
+        printf("%d\t%d\t  %d\t  %d\t   %d\t\t%d\t%f\n",f[i].name,f[i].atime,f[i].arun,f[i].runtime,f[i].ftime,f[i].total,f[i].welght);
+        f[i+1].arun=f[i].arun+f[i].ftime;
+    }
+
+    printf("������ ���̵��� ��ʼ���� �������� ���̽��� ��תʱ�� ��תϵ��\n");
+    for(i=0;i<amount;i++)
+    {
+        printf("%d\t%d\t  %d\t  %d\t   %d\t\t%d\t%f\n",f[i].name,f[i].atime,f[i].arun,f[i].runtime,f[i].ftime,f[i].total,f[i].welght);
+    }
+}
diff --git a/计算机组成原理实验代码/FCFS_2.cpp b/计算机组成原理实验代码/FCFS_2.cpp
new file mode 100644
index 0000000..1d8f896
--- /dev/null
+++ b/计算机组成原理实验代码/FCFS_2.cpp
@@ -0,0 +1,111 @@
+
+#include<iostream>
+using namespace std;
+#define  N  3
+struct  PCB
+{
+	char name[8];
+	int  arrive_time;
+	int  run_time;
+    int finish_time;
+	int  zhouzhuan_time;
+	float daiquan_time;
+};
+
+float sumzhouzhuantime,sumdaiquanzhouzhuantime;
+struct PCB pcb[N],temp;
+
+void input();  //�������
+void sort();      //������Ľ��̰�����ʱ���������ִ��
+void output();   //����㷨����ʱ���
+
+int  main()
+{   
+    input();
+	sort( );
+	output();
+}
+
+void input()
+{
+    int i;
+	cout<<"--------------------------------------"<<endl;
+	cout<<"             FCFS�����㷨     "<<endl;
+    cout<<"--------------------------------------"<<endl;
+	cout<<"      �������������Ϣ:"<<endl;
+	for ( i=0;i<N;i++)
+	{
+		printf("�����������:\n" );
+        scanf("%s",pcb[i].name);
+		printf("�����뵽��ʱ��:");
+		scanf("%d",&pcb[i].arrive_time);
+		printf("������Ҫ����ʱ��:");
+		scanf("%d",&pcb[i].run_time);		
+	}
+	cout<<"������:"<<endl;
+	for( i=0;i<N;i++)
+	{  	printf("%s    ",pcb[i].name);
+        printf("%d    ",pcb[i].arrive_time);
+		printf("%d \n",pcb[i].run_time);
+    }
+}
+
+void sort()//���յ���ʱ��Խ��̽������� 
+{
+	for(int i=0;i<N-1;i++)
+	{
+		for(int j=i+1;j<N;j++)
+		{
+			if(pcb[i].arrive_time>pcb[j].arrive_time)
+			{
+				temp=pcb[i];
+				pcb[i]=pcb[j];
+				pcb[j]=temp;
+			}
+		}
+	} 
+}
+
+void  output()
+{   
+	int i;
+	cout<<"FCFS�����㷨:"<<endl;
+    	pcb[0].finish_time=pcb[0].arrive_time+pcb[0].run_time;
+     	pcb[0].zhouzhuan_time=pcb[0].finish_time-pcb[0].arrive_time;
+		pcb[0].daiquan_time=(float)pcb[0].zhouzhuan_time/pcb[0].run_time;
+  	for(i=1;i<N;i++)
+	{	 
+	 	if(pcb[i].arrive_time>pcb[i-1].finish_time)
+		{
+              pcb[i].finish_time=pcb[i].arrive_time+pcb[i].run_time;
+              pcb[i].zhouzhuan_time=pcb[i].run_time;
+              pcb[i].daiquan_time=(float)pcb[i].zhouzhuan_time/pcb[i].run_time;
+		}
+		else
+		{
+            pcb[i].finish_time=pcb[i-1].finish_time+pcb[i].run_time;
+            pcb[i].zhouzhuan_time=pcb[i].finish_time-pcb[i].arrive_time;
+			pcb[i].daiquan_time=(float)pcb[i].zhouzhuan_time/pcb[i].run_time;
+		}
+    	
+	}  
+
+	for(i=0;i<N;i++)
+		{
+			sumzhouzhuantime+=pcb[i].zhouzhuan_time;
+			sumdaiquanzhouzhuantime+=pcb[i].daiquan_time;
+		}
+
+    printf("----------------------------------------------------------------\n");
+    printf("������   ����ʱ��  ����ʱ��  ���ʱ��  ��תʱ��    ��Ȩ��תʱ��  \n");
+	printf("----------------------------------------------------------------\n");
+    for(i=0;i<N;i++)
+	{
+	  	printf(" %s        %d         %d         %d         %d         %.2f\n",pcb[i].name,pcb[i].arrive_time,pcb[i].run_time,pcb[i].finish_time,pcb[i].zhouzhuan_time,pcb[i].daiquan_time);
+
+	}
+	cout<<"ƽ����תʱ��:"<<sumzhouzhuantime/N<<endl;
+	cout<<"ƽ����Ȩ��תʱ��:"<<sumdaiquanzhouzhuantime/N<<endl;
+    printf("----------------------------------------------------------------\n");
+}
+
diff --git a/计算机组成原理实验代码/FenPei.cpp b/计算机组成原理实验代码/FenPei.cpp
new file mode 100644
index 0000000..291ecbd
--- /dev/null
+++ b/计算机组成原理实验代码/FenPei.cpp
@@ -0,0 +1,331 @@
+#define _CRT_SECURE_NO_WARNINGS 1
+ 
+#include<stdio.h>
+#include<stdlib.h>
+ 
+enum STATE 
+{ 
+Free,
+Busy
+};
+ 
+struct subAreaNode 
+{
+int addr;              // ��ʼ��ַ
+int size;              // ������С
+int taskId;            // ��ҵ��
+STATE state;             // ����״̬
+subAreaNode *pre;     // ����ǰ��ָ��
+subAreaNode *nxt;       // ��������ָ��
+}subHead;
+ 
+// ��ʼ�����з�����
+void intSubArea()
+{
+// �����ʼ�����ڴ�
+subAreaNode *fir = (subAreaNode *)malloc(sizeof(subAreaNode));
+// ���׸�������ֵ
+fir->addr = 0;
+fir->size = 1000;     // �ڴ��ʼ��С
+fir->state = Free;
+fir->taskId = -1;
+fir->pre = &subHead;
+fir->nxt = NULL;
+// ��ʼ������ͷ����Ϣ
+subHead.pre = NULL;
+subHead.nxt = fir;
+}
+ 
+// �״���Ӧ�㷨
+int firstFit(int taskId, int size)
+{
+subAreaNode *p = subHead.nxt;
+while (p != NULL)
+{
+if (p->state == Free && p->size >= size)
+{
+// �ҵ�Ҫ����Ŀ��з���
+if (p->size - size <= 10)
+{
+// �������
+p->state = Busy;
+p->taskId = taskId;
+}
+else {
+// �����СΪsize������
+subAreaNode *node = (subAreaNode *)malloc(sizeof(subAreaNode));
+node->addr = p->addr + size;
+node->size = p->size - size;
+node->state = Free;
+node->taskId = -1;
+// �޸ķ������ڵ�ָ��
+node->pre = p;
+node->nxt = p->nxt;
+if (p->nxt != NULL)
+{
+p->nxt->pre = node;
+}
+p->nxt = node;
+// �����������
+p->size = size;
+p->state = Busy;
+p->taskId = taskId;
+}
+printf("�ڴ����ɹ���\n");
+return 1;
+}
+p = p->nxt;
+}
+printf("�Ҳ������ʵ��ڴ����������ʧ��...\n");
+return 0;
+}
+ 
+// �����Ӧ�㷨
+int bestFit(int taskId, int size)
+{
+subAreaNode *tar = NULL;
+int tarSize = 1000 + 1;
+subAreaNode *p = subHead.nxt;
+while (p != NULL)
+{
+// Ѱ����ѿ�������
+if (p->state == Free && p->size >= size && p->size < tarSize) {
+tar = p;
+tarSize = p->size;
+}
+p = p->nxt;
+}
+if (tar != NULL) {
+// �ҵ�Ҫ����Ŀ��з���
+if (tar->size - size <= 10)
+{
+// �������
+tar->state = Busy;
+tar->taskId = taskId;
+}
+else
+{
+// �����СΪsize������
+subAreaNode *node = (subAreaNode *)malloc(sizeof(subAreaNode));
+node->addr = tar->addr + size;
+node->size = tar->size - size;
+node->state = Free;
+node->taskId = -1;
+// �޸ķ������ڵ�ָ��
+node->pre = tar;
+node->nxt = tar->nxt;
+if (tar->nxt != NULL) 
+{
+tar->nxt->pre = node;
+}
+tar->nxt = node;
+// �����������
+tar->size = size;
+tar->state = Busy;
+tar->taskId = taskId;
+}
+printf("�ڴ����ɹ���\n");
+return 1;
+}
+else
+{
+printf("�Ҳ������ʵ��ڴ����������ʧ��...\n");
+return 0;
+}
+}
+ 
+int freeSubArea(int taskId)     // �����ڴ�
+{
+int flag = 0;
+subAreaNode *p = subHead.nxt, *pp;
+while (p != NULL)
+{
+if (p->state == Busy && p->taskId == taskId)
+{
+flag = 1;
+if ((p->pre != &subHead && p->pre->state == Free)
+&& (p->nxt != NULL && p->nxt->state == Free))
+{
+// ���1���ϲ�������������
+// �Ⱥϲ�������
+pp = p;
+p = p->pre;
+p->size += pp->size;
+p->nxt = pp->nxt;
+pp->nxt->pre = p;
+free(pp);
+// ��ϲ�������
+pp = p->nxt;
+p->size += pp->size;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else if ((p->pre == &subHead || p->pre->state == Busy)
+&& (p->nxt != NULL && p->nxt->state == Free)) 
+{
+// ���2��ֻ�ϲ�����ķ���
+pp = p->nxt;
+p->size += pp->size;
+p->state = Free;
+p->taskId = -1;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else if ((p->pre != &subHead && p->pre->state == Free)
+&& (p->nxt == NULL || p->nxt->state == Busy)) 
+{
+// ���3��ֻ�ϲ�����ķ���
+pp = p;
+p = p->pre;
+p->size += pp->size;
+p->nxt = pp->nxt;
+if (pp->nxt != NULL) 
+{
+pp->nxt->pre = p;
+}
+free(pp);
+}
+else
+{
+// ���4�����·��������úϲ�
+p->state = Free;
+p->taskId = -1;
+}
+}
+p = p->nxt;
+}
+if (flag == 1)
+{
+// ���ճɹ�
+printf("�ڴ�������ճɹ�...\n");
+return 1;
+}
+else 
+{
+// �Ҳ���Ŀ����ҵ������ʧ��
+printf("�Ҳ���Ŀ����ҵ���ڴ��������ʧ��...\n");
+return 0;
+}
+}
+ 
+// ��ʾ���з��������
+void showSubArea()
+{
+printf("*********************************************\n");
+printf("**         ��ǰ���ڴ����������£�        **\n");
+printf("*********************************************\n");
+printf("** ��ʼ��ַ | �ռ��С | ����״̬ | ��ҵ�� **\n");
+subAreaNode *p = subHead.nxt;
+while (p != NULL)
+{
+printf("**-----------------------------------------**\n");
+printf("**");
+printf("  %3d  k  |", p->addr);
+printf("  %3d  k  |", p->size);
+printf("   %s   |", p->state == Free ? "Free" : "Busy");
+if (p->taskId > 0) 
+{
+printf("   %2d   ", p->taskId);
+}
+else
+{
+printf("        ");
+}
+printf("**\n");
+p = p->nxt;
+}
+printf("*********************************************\n");
+}
+ 
+int main()
+{
+int option, ope, taskId, size;
+// ��ʼ�����з�����
+intSubArea();
+// ѡ������㷨
+while (1)
+{
+printf("\n\n");
+printf("\t****************��ѡ��Ҫģ��ķ����㷨******************\n");
+printf("\n\n");
+printf("\t \t        0    �״���Ӧ�㷨  \n");
+printf("\n\n");
+printf("\t \t        1    �����Ӧ�㷨  \n");
+printf("\n\n");
+printf("\t\t\t\t���ѡ����:");
+scanf("%d", &option);
+if (option == 0)
+{
+printf("��ѡ�����״���Ӧ�㷨����������㷨��ģ��\n");
+break;
+}
+else if (option == 1)
+{
+printf("��ѡ���������Ӧ�㷨����������㷨��ģ��\n");
+break;
+}
+else
+{
+printf("���������� 0/1\n\n");
+}
+}
+// ģ�⶯̬���������㷨
+while (1)
+{
+printf("\n");
+printf("*********************************************\n");
+printf("**  1: �����ڴ�  2: �����ڴ�  0: �˳�     **\n");
+printf("*********************************************\n");
+scanf("%d", &ope);
+if (ope == 0) break;
+if (ope == 1) {
+// ģ������ڴ�
+printf("��������ҵ�ţ� ");
+scanf("%d", &taskId);
+printf("��������Ҫ������ڴ��С(KB)�� ");
+scanf("%d", &size);
+if (size <= 0) 
+{
+printf("���󣺷����ڴ��С����Ϊ��ֵ\n");
+continue;
+}
+// ���÷����㷨
+if (option == 0) 
+{
+firstFit(taskId, size);
+}
+else 
+{
+bestFit(taskId, size);
+}
+// ��ʾ���з��������
+showSubArea();
+}
+else if (ope == 2)
+{
+// ģ������ڴ�
+printf("������Ҫ���յ���ҵ�ţ� ");
+scanf("%d", &taskId);
+freeSubArea(taskId);
+// ��ʾ���з��������
+showSubArea();
+}
+else 
+{
+printf("���������� 0/1/2\n");
+}
+}
+printf("�����㷨ģ�����\n");
+system("pause");
+return 0;
+}
+
+
diff --git a/计算机组成原理实验代码/Fibonacci.cpp b/计算机组成原理实验代码/Fibonacci.cpp
new file mode 100644
index 0000000..3c77240
--- /dev/null
+++ b/计算机组成原理实验代码/Fibonacci.cpp
@@ -0,0 +1,69 @@
+/*------------------------------------------------
+��������ơ�
+--------------------------------------------------
+/*    ��д����fun�����Ĺ����ǣ���Fibonacci�����д���s����С��һ����������ɺ������ء�����Fibonacci����F(n)�Ķ���Ϊ��
+    F(0)=0��F(1)=1
+    F(n)=F(n-1)+F(n-2)
+    ���磺��s=1000ʱ������ֵΪ��1597��
+    ע�⣺����Դ��������ļ�prog.c�С�
+    ����Ķ�������main�����������е��κ����ݣ����ں���fun�Ļ��������������д��������䡣
+*********Begin**********��**********  End  **********����ɾ��
+*/
+
+
+
+#include <conio.h>
+#include <math.h>
+#include <stdio.h>
+#include<windows.h>
+int fun(int s)
+{
+    /**********  Begin  **********/
+int f1,f2,f;
+	f1=0;
+	f2=1;
+	do
+	{
+		f=f1+f2;
+		f1=f2;
+		f2=f;
+	}
+	while(f2<=s);
+	
+return f2;
+
+
+
+  
+  
+    /**********   End  ***********/
+
+}
+
+
+void NONO (  )
+{/* ���������ڴ��ļ����������ݣ����ú�����������ݣ��ر��ļ��� */
+  FILE *fp, *wf ;
+  int i, n, s ;
+
+  fp = fopen("bc06.in","r") ;
+  if(fp == NULL) {
+    printf("�����ļ�bc06.in������!") ;
+  }
+  wf = fopen("bc06.out","w") ;
+  for(i = 0 ; i < 10 ; i++) {
+    fscanf(fp, "%d", &n) ;
+    s = fun(n) ;
+    fprintf(wf, "%d\n", s) ;
+  }
+  fclose(fp) ;
+  fclose(wf) ;
+}
+
+main()   /*������*/
+{   int n;
+    system("cls");
+ 	n=1000;
+    printf("n=%d,f=%d\n",n,fun(n));
+   NONO();
+}
diff --git a/计算机组成原理实验代码/First_Fit_1.cpp b/计算机组成原理实验代码/First_Fit_1.cpp
new file mode 100644
index 0000000..d76f88a
--- /dev/null
+++ b/计算机组成原理实验代码/First_Fit_1.cpp
@@ -0,0 +1,131 @@
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <vector>
+#include <iostream>
+using namespace std;
+struct FF {
+	char name[10];
+	float address;//��ʼ��ַ
+	float AFFival_time;//û�� 
+	float Service_hours;//û�� 
+	float Process_size;//���̴�С 
+	float size;//���ڴ���һ��һ���ֵ 
+	float max_size;//�ڴ����ֵ 
+	float state;//0Ϊ���� 1Ϊ�����У�������Ϊʲô����bool ����Ϊ��Ϯֻ����60 
+};
+void print_Memory(FF *p,int N);//�ڴ�ռ��ӡ���� 
+void recovery(FF *p,int N);//���պ��������չ��� 
+void input(FF *p, int N);//���뺯�� 
+void run(FF *p,int N);//����ʽ���� 
+void detelex(FF *p,int N);//�������̺��� 
+void input(FF *p, int N) {
+	int i;
+	int x=0;
+	printf("����ϵͳ�ڴ��С");
+	scanf("%f",&p[0].max_size);
+	printf("\n");
+	for(i = 0; i <= N - 1; i++) {
+		printf("�����%d�����̵�����,����ʱ��,����ʱ��,���̴�С(���磺1 2 1 5)��\n", i+1);
+		scanf("%s %f %f %f", p[i].name, &p[i].AFFival_time, &p[i].Service_hours,&p[i].Process_size);
+	}
+}
+
+void print(FF *p,int N){
+	for(int i=0;i<=N;i++){
+		printf(p[i].name, &p[i].AFFival_time, &p[i].Service_hours,&p[i].Process_size);
+	}
+}
+void distribution(FF *p,int N) {
+	int i;
+	p[0].size=p[0].max_size;
+ 
+	for (i=0; i<N; i++) {
+		p[i+1].size=p[i].Process_size;
+		if(p[0].size>=p[i].Process_size) {
+			p[0].size=p[0].size-p[i].Process_size;
+			p[i+1].state=1;
+		} else {
+			printf("��%d�����̽�ȥ����",i+1);
+			printf("������лл�㣬�ڴ治��\n");
+			p[i+1].size=p[0].size;
+			p[i+1].state=0;
+			print_Memory(p, N);
+		}
+	}
+}
+void recovery(FF *p,int N) {//����һ�ٷֻ����Ͽ������� 
+	int i;
+	for(i=1; i<N; i++) {
+		if(p[i].state==0&&p[i+1].state==0) {
+	
+			p[i].size=p[i].size+p[i+1].size;
+			p[i+1].size=0;
+		}
+	}
+	printf("\n�������\n");
+}
+void print_Memory(FF *p,int N) { 
+	int i;
+	float q;
+	p[0].address=0;
+	printf("\n�ڴ��ʹ��״̬\n");
+	for (i=1; i<=N; i++) {
+		printf("��ʼ��ַ:\t");
+		q+=p[i].size;
+		p[i].address=q;
+		printf("%f\t",p[i-1].address);
+		printf("������С:\t");
+		printf("%f\t",p[i].size);
+		if(p[i].state==1) {
+			printf("\t���ڹ���\n");
+		} else {
+			printf("\t����\n");
+		}
+	}
+	printf("ʣ���ڴ�");
+	printf("%f",p[0].size);
+}
+void run(FF *p,int N) {
+	int xx=0;
+	while(xx!=4) {
+		printf("\n�ͷ��ڴ��밴1�������ڴ��밴2���鿴�ڴ��밴3���˳��밴4\n");
+		cin>>xx;
+		if(xx==1) {
+			detelex(p, N);
+            print(p,N);
+		} else if(xx==2) {
+			recovery(p, N);
+		} else if(xx==3) {
+			print_Memory(p, N);
+		} 
+	}
+}
+void detelex(FF *p,int N) {
+	float yy;
+	printf("\n����ɾ�����̵���ʼ��ַ\n");
+	scanf("%f",&yy);
+	for(int i =0;i<N;i++){
+		if(yy==p[i].address){
+		cout<<"��ɾ��"<<"\n";
+		p[i+1].state=0;
+	}
+};
+}
+void FF_MAIN() {
+	int N;
+	printf("��������̵�����:\n");
+	scanf("%d",&N);
+	FF *p = new FF[N];
+	input(p, N);
+	distribution(p,N);
+	run (p,N);
+	delete [] p;
+}
+int main() {
+	FF_MAIN();
+	return 0;
+
+}
+
diff --git a/计算机组成原理实验代码/First_Fit_2.cpp b/计算机组成原理实验代码/First_Fit_2.cpp
new file mode 100644
index 0000000..af04632
--- /dev/null
+++ b/计算机组成原理实验代码/First_Fit_2.cpp
@@ -0,0 +1,278 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+enum STATE {
+	F, W
+};
+
+struct subAreaNode {
+	int addr;              // ��ʼ��ַ
+	int size;              // ������С
+	int taskId;            // ��ҵ��
+	STATE state;             // ����״̬
+	subAreaNode *pre;     // ����ǰ��ָ��
+	subAreaNode *nxt;       // ��������ָ��
+} subHead;
+
+
+// ��ʼ�����з�����
+void intSubArea() {
+// �����ʼ�����ڴ�
+	subAreaNode *fir = (subAreaNode *)malloc(sizeof(subAreaNode));
+// ���׸�������ֵ
+	fir->addr = 0;
+	fir->size = 95;     // �ڴ��ʼ��С
+	fir->state = F;
+	fir->taskId = -1;
+	fir->pre = &subHead;
+	fir->nxt = NULL;
+// ��ʼ������ͷ����Ϣ
+	subHead.pre = NULL;
+	subHead.nxt = fir;
+}
+
+//// �״���Ӧ�㷨
+//int firstFit(int taskId, int size)
+//{
+//subAreaNode *p = subHead.nxt;
+//while (p != NULL)
+//{
+//if (p->state == F && p->size >= size)
+//{
+//// �ҵ�Ҫ����Ŀ��з���
+//if (p->size - size <= 10)
+//{
+//// �������
+//p->state = W;
+//p->taskId = taskId;
+//}
+//else {
+//// �����СΪsize������
+//subAreaNode *node = (subAreaNode *)malloc(sizeof(subAreaNode));
+//node->addr = p->addr + size;
+//node->size = p->size - size;
+//node->state = F;
+//node->taskId = -1;
+//// �޸ķ������ڵ�ָ��
+//node->pre = p;
+//node->nxt = p->nxt;
+//if (p->nxt != NULL)
+//{
+//p->nxt->pre = node;
+//}
+//p->nxt = node;
+//// �����������
+//p->size = size;
+//p->state = W;
+//p->taskId = taskId;
+//}
+//printf("�ڴ����ɹ���\n");
+//return 1;
+//}
+//p = p->nxt;
+//}
+//printf("�Ҳ������ʵ��ڴ����������ʧ��...\n");
+//return 0;
+//}
+
+
+//struct subAreaNode *node
+
+void BestFit(int taskId, int size) { //���Ӧ
+	//��ѿ�ָ��
+	struct subAreaNode *q = NULL;
+	subAreaNode *node = subHead.nxt;
+	//�����ҵ���һ�����������Ŀ��п�
+	while (node != NULL) {
+		if (node->state == F && node->size >= size) {
+			q = node;
+			break;
+		}
+		//�����һ��Ϊ����˵��û�п��������Է���
+		if (node->nxt == NULL) {
+			printf("����ʧ�ܣ�û���㹻�Ŀռ䣡\n");
+			break;
+		} else {
+			node = node->nxt;
+		}
+
+	}
+	//����Ѱ����ѵĿ��п�
+	while (node != NULL) {
+		if (node->state == F && node->size >= size && node->size < q->size) { //���еĿռ�
+			q = node;
+		}
+		node = node->nxt;
+	}
+	if (q->size > size) {  			//��ѿ��п�Ĵ�С���������С
+		//�����ʣ��Ŀռ�
+		struct subAreaNode *p = (struct subAreaNode*)malloc(sizeof(struct subAreaNode));
+		p->addr = q->addr + size;
+		p->size = q->size - size;
+		p->state = F;
+		p->taskId = -1;
+		//����Ŀռ�
+		q->taskId = taskId;
+		q->size = size;
+		q->state = W;
+		//�ı�ڵ������
+		p->nxt = q->nxt;
+		q->nxt = p;
+	} else if (q->size == size) {  	//��ѿ��п�ռ��С���������
+		q->taskId = taskId;
+		q->size = size;
+		q->state = W;
+	}
+}
+
+
+
+
+
+
+
+int freeSubArea(int taskId) {   // �����ڴ�
+	int flag = 0;
+	subAreaNode *p = subHead.nxt, *pp;
+	while (p != NULL) {
+		if (p->state == W && p->taskId == taskId) {
+			flag = 1;
+			if ((p->pre != &subHead && p->pre->state == F)
+			    && (p->nxt != NULL && p->nxt->state == F)) {
+// ���1���ϲ�������������
+// �Ⱥϲ�������
+				pp = p;
+				p = p->pre;
+				p->size += pp->size;
+				p->nxt = pp->nxt;
+				pp->nxt->pre = p;
+				free(pp);
+// ��ϲ�������
+				pp = p->nxt;
+				p->size += pp->size;
+				p->nxt = pp->nxt;
+				if (pp->nxt != NULL) {
+					pp->nxt->pre = p;
+				}
+				free(pp);
+			} else if ((p->pre == &subHead || p->pre->state == W)
+			           && (p->nxt != NULL && p->nxt->state == F)) {
+// ���2��ֻ�ϲ�����ķ���
+				pp = p->nxt;
+				p->size += pp->size;
+				p->state = F;
+				p->taskId = -1;
+				p->nxt = pp->nxt;
+				if (pp->nxt != NULL) {
+					pp->nxt->pre = p;
+				}
+				free(pp);
+			} else if ((p->pre != &subHead && p->pre->state == F)
+			           && (p->nxt == NULL || p->nxt->state == W)) {
+// ���3��ֻ�ϲ�����ķ���
+				pp = p;
+				p = p->pre;
+				p->size += pp->size;
+				p->nxt = pp->nxt;
+				if (pp->nxt != NULL) {
+					pp->nxt->pre = p;
+				}
+				free(pp);
+			} else {
+// ���4�����·��������úϲ�
+				p->state = F;
+				p->taskId = -1;
+			}
+		}
+		p = p->nxt;
+	}
+	if (flag == 1) {
+// ���ճɹ�
+		printf("�ڴ�������ճɹ�...\n");
+		return 1;
+	} else {
+// �Ҳ���Ŀ����ҵ������ʧ��
+		printf("�Ҳ���Ŀ����ҵ���ڴ��������ʧ��...\n");
+		return 0;
+	}
+}
+
+// ��ʾ���з��������
+void showSubArea() {
+	printf("\n");
+	printf("         ��ǰ���ڴ����������£�        \n");
+	printf("          W:����״̬ F:����״̬           \n");
+	printf("___________________________________________\n");
+	printf("| ��ʼ��ַ | �ռ��С | ����״̬ | ��ҵ�� |\n");
+	subAreaNode *p = subHead.nxt;
+	while (p != NULL) {
+		printf("___________________________________________\n");
+
+		printf("  %3d  k  |", p->addr);
+		printf("  %3d  k  |", p->size);
+		printf("   %s   |", p->state == F ? "F" : "W");
+		if (p->taskId > 0) {
+			printf("   %2d   ", p->taskId);
+		} else {
+			printf("        ");
+		}
+		printf("\n");
+		p = p->nxt;
+	}
+	printf("___________________________________________\n");
+}
+
+int main() {
+	int  ope, taskId, size;
+	char name;
+	int ArriveTime;
+	int ServerTime;
+// ��ʼ�����з�����
+	intSubArea();
+
+// ģ�⶯̬���������㷨
+	while (1) {
+		printf("Ĭ��FF(�״���Ӧ�㷨)\n");
+		printf("_________________________________________\n");
+		printf("| 1: �����ڴ�  2: �����ڴ�  0: �˳�      |\n");
+		printf("|________________________________________|\n");
+		scanf("%d", &ope);
+		if (ope == 0) break;
+		if (ope == 1) {
+// ģ������ڴ�
+			printf("��������ҵ�ţ� ");
+			scanf("%d", &taskId);
+			printf("��������ҵ���� ");
+			scanf("%s", &name);
+			printf("�����뵽��ʱ�䣺 ");
+			scanf("%d", &ArriveTime);
+			printf("���������ʱ�䣺 ");
+			scanf("%d", &ServerTime);
+			printf("��������Ҫ������ڴ��С(KB)�� ");
+			scanf("%d", &size);
+			if (size <= 0) {
+				printf("���󣺷����ڴ��С����Ϊ��ֵ\n");
+				continue;
+			}
+// ���÷����㷨
+
+//firstFit(taskId, size);
+			BestFit(taskId, size);
+
+// ��ʾ���з��������
+			showSubArea();
+		} else if (ope == 2) {
+// ģ������ڴ�
+			printf("������Ҫ���յ���ҵ�ţ� ");
+			scanf("%d", &taskId);
+			freeSubArea(taskId);
+// ��ʾ���з��������
+			showSubArea();
+		} else {
+			printf("���������� 0/1/2\n");
+		}
+	}
+	printf("�����㷨ģ�����\n");
+	system("pause");
+	return 0;
+}
diff --git a/计算机组成原理实验代码/OPT.cpp b/计算机组成原理实验代码/OPT.cpp
new file mode 100644
index 0000000..ba978e6
--- /dev/null
+++ b/计算机组成原理实验代码/OPT.cpp
@@ -0,0 +1,108 @@
+#include <stdio.h>
+#include <iostream>
+using namespace std;
+int number=0;
+int Pyblock=0;
+int opt(int a[])
+{
+    int i, j, zero = 0, one = 0, two = 0, q = 0;
+    int b[Pyblock];
+    for (i = 0; i < Pyblock; i++)
+    {
+        b[i] =-1;  //��Ϊ-1 
+    }
+    for (i = 0; i < number; i++)
+    {
+        if (i < 3)
+        {
+            q++;
+            for (j = 0; j < Pyblock; j++)
+            {
+                if (b[j] == -1)
+                {
+                    b[j] = a[i];
+                    break;
+                }
+            }
+        }
+        else
+        {
+            if (b[0] != a[i])
+            {
+            	if (b[1] != a[i])
+				{
+					if(b[2] != a[i]){
+		                q++;
+		                for (int t = i + 1; t < number; t++)
+		                {
+		                    if (b[0] == a[t])
+		                        zero = 1;
+		                    else if (b[1] == a[t])
+		                        one = 1;
+		                    else if (b[2] == a[t])
+		                        two = 1;
+		                    if (zero == 1 && one == 1 && two == 0)
+		                    {
+		                        b[2] = a[i];
+		                        break;
+		                    }
+		                    else if (zero == 1 && one == 0 && two == 1)
+		                    {
+		                        b[1] = a[i];
+		                        break;
+		                    }
+		                    else if (zero == 0 && one == 1 && two == 1)
+		                    {
+		                        b[0] = a[i];
+		                        break;
+		                    }
+                }
+            	}
+            	}
+            }
+        }
+        for (int f = 0; f < Pyblock; f++)
+        {
+            printf("%d\t", b[f]);
+        }
+        printf("\n");
+        zero = 0;
+        one = 0;
+        two = 0;
+    }
+    return q;
+}
+
+int main()
+{
+    int o;
+
+    while(1) 
+	{
+		printf("����������������ĸ���:\n");
+		scanf("%d",&Pyblock);
+		printf("\n");
+		break;
+	}
+	
+	while(1)
+	{
+		printf("������ҳ�����и���:\n");
+		scanf("%d",&number);			
+		printf("\n");
+		break;
+	}
+    int a[number];
+    printf("����������ҳ������:\n");
+    for (int i = 0; i < number; i++)
+    {
+        cin>>a[i];
+    }
+    printf("optҳ���û��㷨��\n");
+    o = opt(a);
+    printf("ȱҳ%d�Σ��û�%d��, ȱҳ��:%.2f%% .\n\n\n", o, o - Pyblock,((double)o/number)*100);
+    return 0;
+}
+
+//4 3 2 1 4 3 5 4 3 2 1 5
+
diff --git a/计算机组成原理实验代码/OPT2.cpp b/计算机组成原理实验代码/OPT2.cpp
new file mode 100644
index 0000000..ebdd828
--- /dev/null
+++ b/计算机组成原理实验代码/OPT2.cpp
@@ -0,0 +1,124 @@
+#include<stdio.h>
+int block_num;   //�������������
+int page_num;   //Ҫ���ʵ�ҳ�����и���
+int page[100]; //Ҫ���ʵ�ҳ������
+int memory[10]; //�������е�ҳ��
+int table[100][10]; //��ʾ����
+int reg[10];  //�Ĵ���--��¼ҳ��ķ���ʱ��
+char Que[100];  //���飬��¼�Ƿ�ȱҳ
+ 
+int main()
+{	
+    int count=0; //��¼ȱҳ����  
+    int i,j,k;	
+	while(1) 
+	{
+		printf("����������������ĸ���(M<=10):\n");
+		scanf("%d",&block_num);
+		printf("\n");
+		break;
+	}
+		
+	while(1)
+	{
+		printf("������Ҫ���ʵ�ҳ�����и���(P<=100):\n");
+		scanf("%d",&page_num);			
+		printf("\n");
+		break;
+	}
+	
+	printf("����������ҳ������:\n");
+	for(i=0;i<page_num;i++)
+	{
+		scanf("%d",&page[i]);
+		Que[i] = 'N';
+	}
+		 	
+	for(i=0;i<block_num;i++)
+	     memory[i]=-1;   //��ʼ�ڴ����Ĭ��Ϊ�գ���-1��ʾ
+ 
+    //����ҳ��
+	for(i=0;i<page_num;i++)
+	{
+		if(i==0)   //���ʵĵ�һ��ҳ��
+		{
+			memory[i]=page[i];
+			reg[i]=i;
+			for(j=0;j<block_num;j++)
+				table[i][j]=memory[j];
+			Que[i]='Y';
+			count++;
+		}
+		else
+		{    /*�ж���ҳ����Ƿ�����������*/   
+			for(j=0,k=0;j<block_num;j++)
+			{
+				if(memory[j]!=page[i])
+					k++;
+				else
+				{    /*��ҳ�����ڴ����*/
+					reg[j]=i;  //ˢ�¸�ҳ��ķ���ʱ��
+					for(int n=0;n<block_num;n++)
+						table[i][n]=memory[n];
+				}
+			}
+		}
+		if(k==block_num)   /*��ҳ�治���������У�ȱҳ*/
+		{
+			int q=0;
+			Que[i]='Y';
+		    count++;
+			for(int j=0;j<block_num;j++)
+			{
+				if(memory[j]==-1)   /*�ڴ��δ��*/
+				{
+					memory[j]=page[i];
+				    reg[j]=i;
+				    for(int n=0;n<block_num;n++)
+					    table[i][n]=memory[n]; 
+					break;
+				}
+				else   
+					q++;	
+			}
+			if(q==block_num)/*�ڴ�������������LRU�û��㷨ѡ�񻻳�ҳ*/ 
+			{
+			    int min=0;  //��¼����ҳ
+        	    for(int m=1;m<block_num;m++)
+			        if(reg[m]<reg[min])
+				    	min=m;
+		        memory[min]=page[i];
+                reg[min]=i; /*��¼��ҳ�ķ���ʱ�䣨�µ���ҳ�����֮ǰmin��λ�ã��轫minλ�õķ���ʱ����ģ�*/
+                for(int n=0;n<block_num;n++)
+			       table[i][n]=memory[n];
+			}
+		}
+    }
+    
+ 	//������й��̼���� 
+	printf("����OPTҳ���û��㷨�������: \n");
+	printf("\n");
+	printf("\n");
+	printf("ҳ��:");
+	for(i=0;i<page_num;i++)
+		printf("%3d",page[i]);
+	printf("\n");
+	printf("-------------------------\n");
+	for(i=0;i<block_num;i++) 	
+	{
+		printf("%2d:",i);	 
+		for(j=0;j<page_num;j++)
+			printf("%3d",table[j][i]);
+		printf("\n");
+	}
+    printf("-------------------------\n");
+	printf("ȱҳ:");
+	for(i=0;i<page_num;i++)
+	    printf("%3c",Que[i]);
+	printf("\n");
+	
+	printf("-------------------------\n");
+	printf("\tȱҳ����:%d\n",count);
+	printf("\tȱҳ��:%d/%d\n",count,page_num);
+	printf("-------------------------\n");
+}
diff --git a/计算机组成原理实验代码/OPT3.cpp b/计算机组成原理实验代码/OPT3.cpp
new file mode 100644
index 0000000..dace669
--- /dev/null
+++ b/计算机组成原理实验代码/OPT3.cpp
@@ -0,0 +1,88 @@
+#include <stdio.h>
+#define number 11
+#define block 3
+#include <iostream>
+using namespace std;
+int opt(int a[])
+{
+    int i, j, zero = 0, one = 0, two = 0, q = 0;
+    int b[block];
+    for (i = 0; i < block; i++)
+    {
+        b[i] =-1;  //��Ϊ-1 
+    }
+    for (i = 0; i < number; i++)
+    {
+        if (i < 3)
+        {
+//            printf("ȱҳ��%d\n", a[i]);
+            q++;
+            for (j = 0; j < block; j++)
+            {
+                if (b[j] == -1)
+                {
+                    b[j] = a[i];
+                    break;
+                }
+            }
+        }
+        else
+        {
+            if (b[0] != a[i] && b[1] != a[i] && b[2] != a[i])
+            {
+//                printf("ȱҳ��%d\n", a[i]);
+                q++;
+                for (int t = i + 1; t < number; t++)
+                {
+                    if (b[0] == a[t])
+                        zero = 1;
+                    else if (b[1] == a[t])
+                        one = 1;
+                    else if (b[2] == a[t])
+                        two = 1;
+                    if (zero == 1 && one == 1 && two == 0)
+                    {
+                        b[2] = a[i];
+                        break;
+                    }
+                    else if (zero == 1 && one == 0 && two == 1)
+                    {
+                        b[1] = a[i];
+                        break;
+                    }
+                    else if (zero == 0 && one == 1 && two == 1)
+                    {
+                        b[0] = a[i];
+                        break;
+                    }
+                }
+            }
+//            else
+//                printf("%d��ȱҳ��\n", a[i]);
+        }
+        for (int f = 0; f < block; f++)
+        {
+            printf("%d\t", b[f]);
+        }
+        printf("\n");
+        zero = 0;
+        one = 0;
+        two = 0;
+    }
+    return q;
+}
+
+int main()
+{
+    int i, o, l=0,f=0;
+    int a[number];
+    printf("������:\n");
+    for (i = 0; i < number; i++)
+    {
+        cin>>a[i];
+    }
+    printf("optҳ���û��㷨��\n");
+    o = opt(a);
+    printf("ȱҳ%d�Σ��û�%d�Ρ�\n\n\n", o, o - block);
+    return 0;
+}
diff --git a/计算机组成原理实验代码/RR.cpp b/计算机组成原理实验代码/RR.cpp
new file mode 100644
index 0000000..c712211
--- /dev/null
+++ b/计算机组成原理实验代码/RR.cpp
@@ -0,0 +1,169 @@
+#include <iostream>
+#include <queue>
+#include <iomanip>
+using namespace std;
+ 
+typedef struct  
+{
+	char name;
+	int ArrivalTime;
+	int ServiceTime;
+	int FinishedTime;
+	int WholeTime;
+	double WeightWholeTime;
+}RR;
+ 
+static queue<RR>RRqueue;  //����һ������
+static double AverageWT =0,AverageWWT=0;
+static int q;  //ʱ��Ƭ
+static int n;  //���̸���
+static RR RRarray[100];  //���̽ṹ
+ 
+void Input()
+{
+
+ 
+	//�û�����ģʽ
+	cout<<"________________________________________________________"<<endl;
+ 
+	cout<<"�������������";
+	cin>>n;
+	cout<<"������ʱ��Ƭ�� ";
+	cin>>q;
+ 
+	cout<<"�����������:"<<endl;
+	for (int i=0;i<n;i++)
+	{
+		cin>>RRarray[i].name;
+	}
+ 
+	cout<<"����������̵ĵ���ʱ��:"<<endl;
+	for (int i=0;i<n;i++)
+	{
+		cin>>RRarray[i].ArrivalTime;
+	}
+ 
+	cout<<"����������̵ķ���ʱ��:"<<endl;
+	for (int i=0;i<n;i++)
+	{
+		cin>>RRarray[i].ServiceTime;
+	}
+}
+ 
+void RRAlgorithm()
+{
+	char processMoment[100];   //�洢ÿ��ʱ��Ƭp��Ӧ�Ľ�������
+	RRqueue.push(RRarray[0]);
+ 
+	int processMomentPoint = 0;
+	int CurrentTime=0;
+	int tempTime;  
+	int i=1;  //ָ��δ�����Ľ��̵��±�
+	int finalProcessNumber = 0;   //ִ��RR�㷨�󣬽��̵ĸ���
+	int processTime[50];
+ 
+	//CurrentTime�ij�ʼ��
+	if (RRarray[0].ServiceTime>=q)
+	{
+		CurrentTime = q;
+	}
+	else
+	{
+		CurrentTime = RRarray[0].ServiceTime;
+	}
+ 
+	while(!RRqueue.empty())
+	{	
+		for (int j=i;j<n;j++)   //ʹ��������̵ĵ���ʱ��С�ڵ�ǰʱ��Ľ��̶��������
+		{
+			if (RRarray[j].name!=NULL && CurrentTime >= RRarray[j].ArrivalTime) 
+			{
+				RRqueue.push(RRarray[j]);
+				i++;
+			}
+		}
+		if (RRqueue.front().ServiceTime<q)
+		{
+			tempTime = RRqueue.front().ServiceTime;
+		}
+		else
+		{
+			tempTime = q;
+		}
+ 
+		RRqueue.front().ServiceTime -= q;   //����ÿִ��һ�Σ��ͽ������ʱ�� -q
+ 
+		//�����׽��̵����Ʒ���������
+		processMoment[processMomentPoint] = RRqueue.front().name;
+		processMomentPoint++;
+		processTime[finalProcessNumber] = tempTime;
+		finalProcessNumber++;
+ 
+ 
+		if (RRqueue.front().ServiceTime <= 0)  //��ִ����Ľ����˳�����
+		{
+			//RRqueue.front().FinishedTime = CurrentTime;
+			RRqueue.pop();   //������̵ķ���ʱ��С�ڵ��ڣ����ý����Ѿ��������ˣ�������ջ
+ 
+		}
+		else
+		{
+			//�������Ƶ���β
+			RRqueue.push(RRqueue.front());
+			RRqueue.pop();
+		}
+		CurrentTime += tempTime;	
+											
+	}
+ 
+ 
+	for (int i=0;i<n;i++)
+	{
+		RRarray[i].WholeTime = RRarray[i].FinishedTime - RRarray[i].ArrivalTime;
+		RRarray[i].WeightWholeTime = (double)RRarray[i].WholeTime/RRarray[i].ServiceTime;
+	}
+ 
+	double x=0,y=0;
+	for (int i=0;i<n;i++)
+	{
+		x += RRarray[i].WholeTime;
+		y += RRarray[i].WeightWholeTime;
+	}
+ 
+	AverageWT = x/n;
+	AverageWWT = y/n;
+ 
+}
+ 
+void display()
+{
+	cout<<"________________________________________________________"<<endl;
+	cout<<"RR�����㷨ִ�к󣺽��������Ϣ���£�"<<endl;
+	cout<<setw(10)<<"��������ID��"<<" ";
+	cout<<setw(10)<<"����ʱ��"<<" ";
+	cout<<setw(10)<<"����ʱ��"<<" ";
+	cout<<setw(10)<<"���ʱ��"<<" ";
+	cout<<setw(10)<<"��תʱ��"<<" ";
+	cout<<setw(10)<<"��Ȩ��תʱ��"<<endl;
+	for (int i = 0;i<n;i++)
+	{
+		cout<<setw(10)<<RRarray[i].name<<" ";
+		cout<<setw(10)<<RRarray[i].ArrivalTime<<" ";
+		cout<<setw(10)<<RRarray[i].ServiceTime<<" ";
+		cout<<setw(10)<<RRarray[i].FinishedTime<<" ";
+		cout<<setw(10)<<RRarray[i].WholeTime<<" ";
+		cout<<setw(10)<<RRarray[i].WeightWholeTime<<" "<<endl;;
+	}
+	cout<<"���н��̵�ƽ����תʱ�� = "<<AverageWT<<endl;
+	cout<<"���н��̵�ƽ����Ȩ��תʱ�� = "<<AverageWWT<<endl;
+	cout<<"________________________________________________________"<<endl;
+}
+ 
+int main()
+{
+	Input();
+	RRAlgorithm();
+	display();
+	system("pause");
+	return 0;
+}
diff --git a/计算机组成原理实验代码/RR_V2.0.cpp b/计算机组成原理实验代码/RR_V2.0.cpp
new file mode 100644
index 0000000..9efa1b0
--- /dev/null
+++ b/计算机组成原理实验代码/RR_V2.0.cpp
@@ -0,0 +1,97 @@
+#include<iostream>
+using namespace std;
+const int N=10;
+double daoda[N];//�洢����ʱ������� 
+double fuwu[N]; //�洢����ʱ������� 
+double fuwu_[N];//����ʱ��ĸ��� 
+double wancheng[N]={0};//�洢���ʱ������� ,���ʱ���ȶ���ֵΪ0 
+double zhouzhuan[N];//�洢��תʱ������� 
+double daiquanz[N];//�洢��Ȩ��תʱ������� 
+string name[N];//ÿ�����̵����� 
+int main()
+{
+	//RR ʱ��Ƭ��ת�㷨 
+	cout<<"�������������"<<endl; 
+	int n;//��ҵ��
+	cin>>n;
+	cout<<"������"<<n<<"�����̵����֡�����ʱ�������ʱ�䣺"<<endl;
+	for(int i=0;i<n;i++)
+    {
+    	cin>>name[i];//���̵����� ����A B C ֮��� 
+    	cin>>daoda[i]>>fuwu[i];//��ʼ���� ���뵽��ʱ�������ʱ�� 
+    	fuwu_[i]=fuwu[i];//���� 
+	}
+	double q;
+	cout<<"������ʱ��Ƭq:"<<endl;
+	cin>>q;
+	for(int i=0;i<n;i++)//ѡ������ ���ݵ���ʱ���С����������� 
+	{
+		for(int j=0;j<n;j++)
+		{
+			if(daoda[i]<daoda[j])
+			{
+				swap(daoda[i],daoda[j]);//�������⼸����Ϊ��ͬһ�����̵���Щʱ���Ӧ�ı���һ�� 
+				swap(fuwu[i],fuwu[j]);//������ʱ�佻���ˣ���Ӧ������ʱ��ҲӦ�ý��� 
+				swap(fuwu_[i],fuwu_[j]); 
+				swap(zhouzhuan[i],zhouzhuan[j]);
+				swap(daiquanz[i],daiquanz[i]);
+				swap(name[i],name[j]);//���̵�����ҲҪ������ҵ����ı仯���仯 
+			}
+		}
+	}
+	//��ʱ��
+    double addfuwu=0;//�ۼƷ���ʱ�䣬��ʼֵ��Ϊ0 
+    int count=n;//Ϊ�˲��ı��������n��ֵ����count=n 
+    int count1=0;//��ijһ����ת����ɵĽ��� 
+    while(count!=0)//����������Ϊ0��ʱ�� 
+	{
+		count=count-count1;//��ʣ��û����ɵĽ�����Ŀ 
+    	for(int i=0;i<n;i++)
+    	{
+    		if(fuwu[i]<=q)//�����ʣ�µķ���ʱ��С��ʱ��Ƭ 
+    		{
+    			if(wancheng[i]!=0)//�����Ƿ�ֹ�ڽ�����һ�ֵ���תʱ�����ظ����Ѿ���ɵĽ������ȥ 
+				{
+					addfuwu=addfuwu+0;//���ȥ�ۼ�ʱ���0 
+				}
+				else
+				{
+					addfuwu=addfuwu+fuwu[i];//�ۼ�ʱ��͵���֮ǰ���ۼ�ʱ��+�����һ�ֵ������������ʱ�䣨����С��q�� 
+    			    wancheng[i]=addfuwu;//�����ʱ��=Ŀǰ�ۼƷ���ʱ�� 
+    			    count1++;//������һ����ת�����Ľ�����Ŀ 
+				}
+			}
+			else
+			{
+				fuwu[i]=fuwu[i]-q;//ʣ��ķ���ʱ����Ƿ���ʱ��-ʱ��Ƭq 
+				addfuwu=addfuwu+q;//�ۼƷ���ʱ��=֮ǰ����ʱ��+ʱ��Ƭq(��һ��������̵ķ���ʱ��) 
+			}
+		}
+	}
+	// ----------------------
+    //������תʱ��ʹ�Ȩ��תʱ��
+	for(int i=0;i<n;i++)
+	{
+	    zhouzhuan[i]=wancheng[i]-daoda[i];//��תʱ��=���ʱ��-����ʱ�� 
+	    daiquanz[i]=zhouzhuan[i]/fuwu_[i];//��Ȩ��תʱ��=��תʱ��/����ʱ�� 
+	} 
+	cout<<"RR�����㷨ִ�к�,���������Ϣ���£�"<<endl;
+	cout<<"����"<<" "<<"����ʱ��"<<" "<<"����ʱ��"<<" "<<"���ʱ��"<<" "<<"��תʱ��"<<" "<<"��Ȩ��תʱ��"<<endl; 
+	for(int i=0;i<n;i++)
+	{
+		cout<<name[i]<<"     \t";
+		cout<<daoda[i]<<"     \t"<<fuwu_[i]<<"      \t";
+		cout<<wancheng[i]<<"     \t";
+		cout<<zhouzhuan[i]<<"\t"<<daiquanz[i]<<"\t"<<endl; 
+	} 
+	double sum1=0;
+	double sum2=0;
+	for(int i=0;i<n;i++)
+	{
+		sum1+=zhouzhuan[i];//������תʱ��ĺ�  
+		sum2+=daiquanz[i]; //�����Ȩ��תʱ��ĺ� 
+	}
+	cout<<"ƽ����תʱ�䣺"<<sum1/n<<endl;//ƽ����תʱ��=��תʱ��/�������� 
+	cout<<"ƽ����Ȩ��תʱ�䣺"<<sum2/n<<endl;//ƽ����Ȩ��תʱ��=��Ȩ��תʱ��/�������� 
+	return 0;
+}
diff --git a/计算机组成原理实验代码/TestData.txt b/计算机组成原理实验代码/TestData.txt
new file mode 100644
index 0000000..e69de29
diff --git a/计算机组成原理实验代码/raylib_test.cpp b/计算机组成原理实验代码/raylib_test.cpp
new file mode 100644
index 0000000..cb0f39d
--- /dev/null
+++ b/计算机组成原理实验代码/raylib_test.cpp
@@ -0,0 +1,60 @@
+#include <raylib.h>
+#include <math.h>
+
+int main(void) {
+	// 初始化
+	const int screenWidth = 640;
+	const int screenHeight = 480;
+
+	//启用反锯齿
+	SetConfigFlags(FLAG_MSAA_4X_HINT);
+
+	//初始化窗口
+	InitWindow(screenWidth, screenHeight, "Sample");
+
+	// 初始化摄像机
+	Camera3D camera = { 0 };
+	camera.position = (Vector3) {
+		40.0f, 20.0f, 0.0f
+	}; //相机所在位置{x,y,z}
+	camera.target = (Vector3) {
+		0.0f, 0.0f, 0.0f
+	}; //相机朝向位置{x,y,z}
+	camera.up = (Vector3) {
+		0.0f, 1.0f, 0.0f
+	}; //相机正上方朝向矢量
+	camera.fovy = 70.0f; //相机视野宽度
+	camera.projection = CAMERA_PERSPECTIVE; //采用透视投影
+
+	//设置动画帧率（刷新率，fps）为30帧/秒
+	SetTargetFPS(30);
+	//--------------------------------------------------------------------------------------
+	int angle = 0; //多边形旋转角度
+
+	// 主游戏循环
+	while (!WindowShouldClose()) {  //关闭窗口或者按ESC键时返回true
+
+		double time = GetTime();
+		// 每次循环更新一帧
+		// 摄像机围绕y轴转动
+		double cameraTime = time * 0.3;
+		camera.position.x = (float)cos(cameraTime) * 40.0f;
+		camera.position.z = (float)sin(cameraTime) * 40.0f;
+
+		BeginDrawing();
+
+		ClearBackground(WHITE);
+		//以摄像机视角绘制3d内容
+		BeginMode3D(camera);
+		DrawCube(Vector3{0, 0, 0}, 10, 10, 10, VIOLET);
+		DrawCubeWires(Vector3{0, 0, 0}, 10, 10, 10, BLACK);
+		EndMode3D();
+		EndDrawing();
+	}
+
+	//关闭窗口
+	CloseWindow();
+
+	return 0;
+}
+