Description: There n procedures {1,2, ... , n} to be stored on the length L of the tape. I the length of the program is stored on the tape, 1 ≤ i ≤ n. The program storage problem requires a procedure to determine the n program stored on the magnetic tape so that the tape can store as many programs. Under the premise of the program to ensure maximum storage also requires the maximum utilization of the tape.
To Search:
File list (Check if you may need any files):
cidaimax.exe
cidaimax.cpp
Download