EXP 5 - Algorithm part : Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for varied values of n greater than 5000, and record the time taken to sort. The elements can be read from a file or can be generated using the random number generator.
On this page of the site you can watch the video online MERGE SORT ALGORITHM TO SOLVE SORTING PROBLEM- PART 1 with a duration of hours minute second in good quality, which was uploaded by the user Math2Tech Solutions 04 March 2017, share the link with friends and acquaintances, this video has already been watched 222 times on youtube and it was liked by 3 viewers. Enjoy your viewing!