Notes

summary

bytes to kb

Your solutions for the regular and memory-efficient algorithms be in two different programs and both the programs need to produce an output called output.txt and take input.txt file from command line

Memory in the program should be in Kilobytes and Time taken by the program should be in seconds

First line in the output file contains the first 50 characters and last 50 characters of the first string. The first 50 and last 50 characters are separated by a space. The secone line contains the same, but for the second string.

Memory and time values in the output txt file are float values.

The memory plot and the time plot need to have just 2 line plots, one from the basic version and the other from the advanced version. You can estimate datapoints by generating multiple test cases by yourself. You need to generate valid pngs when you submit.

Please don’t use any fancy plots for the graphs for time and memory. Just a line graph of about 15-20 data points should be sufficient.

:51 to :50

Your program should not print anything when it is run. It should only write to output.txt file.

X axis of the plot needs to be the problem size, which is m+n, i.e the sum of the lengths of the strings (not the length of the base strings but the length of the final strings).