Hey all , I am studying Applied Informatics , and I have to admit I am a programming newbie ... I have learned some Python,but I can't set my mind to solve a problem like the following....any guidelined help would be really appreciated !
[Demonstrate the effects of GIL in cpython.]
Create two (effectively three) implementations of the Levenshtein distance and time the results over
the same set of input word pairs (randomly generated):
First implementation should be a classical recursive implementation
Second one should be a task based multithreaded / multiprocess adoption of same algorithm. Use standard python libraries for multithreading and multiprocessing.
Demonstrate that the threaded approach is slower and that the multiprocess approach is faster (on a multicore processor) than the standard implementation.
I ve researched on what the terminology means,but I can't figure out on how to start !