Description: Experiment one: divide and conquer algorithm merge sort and quick sort compare the average time (confirmatory test) test objectives: (1) Comparing a merge sort and quick sort algorithm in the average case which one faster. (2) time complexity to deepen understanding of the concept.
To Search:
File list (Check if you may need any files):
lab1.cpp