1.)Given two sorted array of distinct integers of size n (A, B), Design a divide and conquer algorithm to return the med
Posted: Fri Jul 01, 2022 5:47 am
1.)Given two sorted array of distinct integers of size n (A, B),Design a divide and conqueralgorithm to return the median of the array obtained after mergingA and B, justify youralgorithm and derive the runtime.
2.)Connect n ropes of distinct lengths into a single rope withthe minimum cost. Assume thatthe cost of connecting two ropes equals the sum of their lengths.Derive the runtime andjustify the correctness.
2.)Connect n ropes of distinct lengths into a single rope withthe minimum cost. Assume thatthe cost of connecting two ropes equals the sum of their lengths.Derive the runtime andjustify the correctness.