Program for Worst Fit algorithm in Memory Management

Prerequisite : Partition allocation methods
Worst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. If a large process comes at a later stage, then memory will not have space to accommodate it.

Example: 

Input : blockSize[] = {100, 500, 200, 300, 600};
 processSize[] = {212, 417, 112, 426};
Output:
Process No. Process Size Block no.
 1 212 5
 2 417 2
 3 112 5
 4 426 Not Allocated

👁 first-fit

Implementation:
1- Input memory blocks and processes with sizes.
2- Initialize all memory blocks as free.
3- Start by picking each process and find the
 maximum block size that can be assigned to
 current process i.e., find max(bockSize[1], 
 blockSize[2],.....blockSize[n]) > 
 processSize[current], if found then assign 
 it to the current process.
5- If not then leave that process and keep checking
 the further processes.

Below is implementation of above steps. 

Process No. Process Size Block no.
 1 212 5
 2 417 2
 3 112 5
 4 426 Not Allocated

Time Complexity: O(N*M)  where N is processSize length and M is blockSize length. 
Auxiliary Space: O(N)