Part A: Implement recursive merge sort
Part B: Terminate the recursion for merge sort, when the size of the
segment is at most 10 (H −L ≤ 10 ), and then use insertion sort
write 2 separate programs.
For part A write a program for merge sort using C/C++ programming language. Take your
array size to be [login to view URL] should use recursive Merge sort.
For part B combine merge sort with insertion sort. You should terminate the recursion for merge
sort, when the size of the segment is at most 10 (H −L ≤ 10), and then use insertion sort.
Your program should read from a file called [login to view URL] and write to
a file called out1.txt.
Your program must sort the
numbers in each line in the input file.
25 800 -2 100
200 400 20.57 37
-2 25 100 800
20.57 37 200 400
11 freelancers are bidding on average $32 for this job
Hi, sir. I have rich experience with C/C++, and Data structure and Algorithm. So, I am absolutely sure that I can do the project very well. Let's discuss more via chat Thanks.