You are given two sorted lists of integers, A and B, of size n (you may assume all integers are

distinct). You wish to find the upper median of the union of the two lists.

The median of an odd sized list is defined to be the "middle" element when sorted. Since there

are 2n total elements there is no median element. Instead, there are two middle elements the

lower median and the upper median. (Sometimes in statistics you are told to average these two

medians - we will not do this in this problem.)

Let M (A, B) express the upper median of the union of A and B.

a) Show how you can use the (upper) medians of the two lists to reduce this problem to

its sub-problems. State a precise self-reduction for your problem.

b) State a recursive algorithm that solves the problem based on your reduction.

c) State a tight asymptotic bound on the number of operations used by your algorithm in

the worst case.

Kemahiran: Programming Help, Pengaturcaraan

Tentang Majikan:
( 5 ulasan ) Pune, India

ID Projek: #31008753

## 3 pekerja bebas membida secara purata ₹1150 untuk pekerjaan ini

SHANKY2003

I can solve this problem in python language in which I have experience. You can get the solution as soon as possible.

₹1300 INR dalam 2 hari
(0 Ulasan)
0.0
zessluthier

I have experience in python with data management, math, tensorflow, keras, ocr, etc. I can help you.

₹1150 INR dalam 7 hari
(0 Ulasan)
0.0
lapy113

I can do this problem in O(n) time complexity. I am expert in competitive programming . I can provide you solution in C Java and make you understand the code easily ,also i can do it in log(n).

₹1000 INR dalam sehari
(0 Ulasan)
0.0