首次适应算法c语言实现

以下是使用C语言实现首次适应算法的代码示例：

#include <stdio.h>

#define MAX_PROCESS 10
#define MAX_MEMORY 100

int main()
{
    int processes[MAX_PROCESS], memory[MAX_MEMORY], allocation[MAX_PROCESS];
    int n, m, i, j;

    printf("Enter the number of processes: ");
    scanf("%d", &n);

    printf("Enter the number of memory blocks: ");
    scanf("%d", &m);

    printf("Enter the size of each process: ");
    for (i = 0; i < n; i++) {
        scanf("%d", &processes[i]);
    }

    printf("Enter the size of each memory block: ");
    for (i = 0; i < m; i++) {
        scanf("%d", &memory[i]);
    }

    // Initialize allocation array to -1
    for (i = 0; i < n; i++) {
        allocation[i] = -1;
    }

    // Allocate processes using first fit algorithm
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if (memory[j] >= processes[i]) {
                allocation[i] = j;
                memory[j] -= processes[i];
                break;
            }
        }
    }

    // Print the allocation table
    printf("\nProcess No.\tProcess Size\tBlock No.\n");
    for (i = 0; i < n; i++) {
        printf("%d\t\t%d\t\t", i+1, processes[i]);
        if (allocation[i] != -1) {
            printf("%d\n", allocation[i]+1);
        }
        else {
            printf("Not Allocated\n");
        }
    }

    return 0;
}

该代码实现了首次适应算法的内存分配过程，输入待分配的进程数量、内存块数量、每个进程的大小和每个内存块的大小，输出分配结果。其中，allocation数组记录了每个进程被分配到的内存块编号，若为-1则表示该进程未被分配内存。