hw6 - ] be two arrays, containing m and n numbers,...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCE 750, Fall 2011, Assignment 6 September 27, 2011 Pages 193–194 Exercises 8.1-1, 8.1-3, 8.1-4. Pages 219–220 Exercises 9.2-2, 9.2-3, 9.2-4. Pages 223–224 Exercises 9.3-1, 9.3-3, 9.3-4, 9.3-5, 9.3-9. Pages 224–225 Problems 9-1, 9-2(a,b,c). Variant of Exercise 9.3-8 on Page 223 Let X [1 ...m ] and Y [1 ...n
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ] be two arrays, containing m and n numbers, respectively, with both ar-rays being already in sorted order. Give an O (lg(min( m,n )))-time algorithm to nd the median of all m + n elements in arrays X and Y . [Note: Exercise 9.3-8 asks about the special case where m = n .] 1...
View Full Document

Ask a homework question - tutors are online