Implement the following modification that will save some of


Problem

Our mergesort program for linked lists spends significant time locating the center of each sublist, so that it can be broken in half. Implement the following modification that will save some of this time. Rewrite the divide_from function to use a second parameter giving the length of original list of nodes. Use this to simplify and speed up the subdivision of the lists. What modifications are needed in the functions merge_sort( ) and recursive_merge_sort( )?

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: Implement the following modification that will save some of
Reference No:- TGS02643143

Expected delivery within 24 Hours