⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 practice.cpp

📁 本程序实现了各种算法
💻 CPP
字号:
#include "iostream.h"
#include <windows.h>
#include <dos.h>
# define M 5
# define N 5
# define Q 3
void main()
{
	char ProcessName[M];
	int Priority[N];
	for(int counter=0;counter<N;counter++)
	{
		cout<<"ProcessName["<<counter+1<<"]:";
		cin>>ProcessName[counter];		
		cout<<"Priority["<<counter+1<<"]:";
		cin>>Priority[counter];
		cout<<endl;
	}
	cout<<"先入先出:"<<endl;
	for(int i=0;i<M;i++)
	{
		cout<<"ProcessName["<<i+1<<"] is runing."<<endl;
		cout<<"ProcessName["<<i+1<<"] completed"<<endl;
		cout<<endl;
		Sleep(1000);
	}
	cout<<"按优先权执行:(优先权越小,优先级越高)"<<endl;
	
	int temp;
	for(i=0;i<N-1;i++)
	{
		for(int j=0;j<N-i;j++)
			if(Priority[j]>Priority[j+1])
			{
				temp=Priority[j];
				Priority[j]=Priority[j+1];
				Priority[j+1]=temp;
			}	
		
	}	
	for(i=0;i<N;i++)
	{
		counter=Priority[i];
		cout<<"The Process of Priority "<<counter<<" is runing."<<endl;
		cout<<"The Process of Priority "<<counter<<" completed."<<endl;
		cout<<endl;
		Sleep(1000);
	}
	cout<<"模拟按时间片轮转执行:"<<endl;	
	for(i=0;i<Q;i++)
	{
		for(int j=0;j<N;j++)
		{	cout<<"ProcessName["<<j+1<<"] is runing."<<endl;
			cout<<endl;
			Sleep(1000);
		}
	}
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -