الگوریتم زمان‌بندی LJF در سی شارپ (Longest Job First)

class MainClass
	{
		public static void Main (string[] args)
		{
			ArrayList p = new ArrayList();
			p.Add(new MyProcess(1, 6, 1));
			p.Add(new MyProcess(2, 8, 1));
			p.Add(new MyProcess(3, 7, 2));
			p.Add(new MyProcess(4, 3, 3));
			LJF(p);
			CalWaitingTime(p);
			CalTurnAroundTime(p);
			display(p);
			Console.WriteLine("Press any key to finish program");
			Console.ReadKey ();
		}
		private static void CalTurnAroundTime(ArrayList p) {
			for (int i = 0; i < p.Count; i++) {
				MyProcess temp = (MyProcess)p[i];
				temp.tat = temp.waiting_time + temp.bt;
			}
		}
		public static void display(ArrayList p) {
			Console.WriteLine("Processes " + " Burst time " +
 " Waiting time " + " Turn around time" + " Completion Time "
				+ " Arrival Time");
			for (int i = 0; i < p.Count; i++) {
				MyProcess temp = (MyProcess)p [i];
				Console.WriteLine(" " + temp.pid +
 "\t\t" + temp.bt + "\t\t " + temp.waiting_time + "\t\t "
					+ temp.tat + "\t\t" + temp.completion_time + "\t\t" +temp.art);
			}
		}
		public static void LJF(ArrayList AllProcess) {
			ArrayList waitingProcess = new ArrayList();
			int time = 0;
			int complete_process = 0;
			while (AllProcess.Count != complete_process) {
				CheckArrivalTime(AllProcess, waitingProcess, time);
				if (waitingProcess.Count <= 0) {
					time++;
					continue;
				}
				Sort(waitingProcess);
				MyProcess LongestProcess = (MyProcess)waitingProcess[0];
				time += LongestProcess.bt;
				LongestProcess.completion_time = time;
				LongestProcess.is_finished = true;
				waitingProcess.RemoveAt(0);
				complete_process++;
			}
		}
		public static void CalWaitingTime(ArrayList p) {
			for (int i = 0; i < p.Count; i++) {
				MyProcess p1 = (MyProcess)p[i];
				p1.waiting_time = p1.completion_time - p1.bt - p1.art;
				if (p1.waiting_time < 0) {
					p1.waiting_time = 0;
				}
			}
		}
		public static void Sort(ArrayList waitingProcess) {
			for (int i = 0; i < waitingProcess.Count; i++) {
				for (int j = 0; j < waitingProcess.Count - 1; j++) {
					MyProcess p1 = (MyProcess) waitingProcess[j];
					MyProcess p2 =  (MyProcess) waitingProcess[j + 1];
					if (p2.bt > p1.bt) {
						waitingProcess [j] = waitingProcess [j + 1];
						waitingProcess [j + 1] = p1;
					}
				}
			}
		}
		public static void CheckArrivalTime
(ArrayList Process, ArrayList waitingProcess, int time) {
			for (int i = 0; i < Process.Count; i++) {
				MyProcess p =  (MyProcess) Process[i];
				if (p.art <= time && !p.addTowaiting) {
					p.addTowaiting = true;
					waitingProcess.Add(p);
				}
			}
		}
	}
	public class MyProcess {
		public int pid; // Process ID
		public int bt; // Burst Time
		public int art; // Arrival Time
		public int completion_time;
		public int waiting_time;
		public int tat;//turn around time
		public bool is_finished = false;
		public bool addTowaiting = false;
		public MyProcess(int pid, int bt, int art) {
			this.pid = pid;
			this.bt = bt;
			this.art = art;
		}
	}