Question
Consider a set S of n >= 2 distinct numbers all greater than zero in unsorted order. For each of the problems below: Give an
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.
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.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started