Algorithm Analysis

Anonymous
timer Asked: Mar 26th, 2017

Question Description

Consider a set S of n  2 distinct numbers all greater than zero in unsorted order. For each of the problems below:

• Give an algorithm to determine two distinct numbers x and y in the set S that satisfy the condition(s) of the problem.

• Your algorithm must be specified using pseudocode in the style of the text. • You must justify that your algorithm has the requested run time.

a. in O(n lg n) time, determine x, y  S such that x  y and x y w z    for all w, z  S such that w  z. (20 pts)

b. in O(n) time, determine x, y  S such that x y w z    for all w, z  S for all w, z  S such that w  z. (20 pts)

This question has not been answered.

Create a free account to get help with this and any other question!

Similar Questions
Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors