内存动态分配的首先适应、最优适应、最坏适应算法的实现（java 版）

public class DynamicAssign {

 public static void main(String[] args) {
  Area[] area = new Area[5];
  area[0] = new Area(0, 20);
  area[1] = new Area(1, 30);
  area[2] = new Area(2, 40);
  area[3] = new Area(3, 50);
  area[4] = new Area(4, 150);
  Memory[] memory = new Memory[4];
  memory[0] = new Memory(0, 100);
  memory[1] = new Memory(1, 30);
  memory[2] = new Memory(2, 50);
  memory[3] = new Memory(3, 40);
  FirstAdapt(memory, area);    
  BestAdapt(memory, area);   
  BadAdapt(memory,area);
 }

//首先适应算法

 public static void FirstAdapt(Memory[] memory, Area[] area) {
  int k;
  for (int i = 0; i < memory.length; i++) {
   k = area.length;
   for (int j = 0; j < area.length; j+