Consider the following algorithm, which takes as input a sequence of n integers a_1, a_2,… , a_n and produces as output a matrix M = {m_(ij)} where m_(ij) is the minimum term in the sequence of integers a_i , a_(i+1),… , a_j for j ≥ i and m_(ij) = 0 otherwise. initialize M so that m_(ij) = a_i if j ≥ i and m_(ij) = 0 otherwise for i := 1 to n for j := i + 1 to n for k := i + 1 to j m_(ij) := min(m_(ij), a_k) return M= {m_(ij)} {m_(ij) is the minimum term of a_i , a_(i+1),… , a_j } a) Show that this algorithm uses O(n^3) comparisons to compute the matrix M. b) Show that this algorithm uses Ω(n^3) comparisons to compute the matrix M. Using this fact and part (a), conclude that the algorithms uses Θ(n^3) comparisons. [Hint: Only consider the cases where i ≤ n∕4 and j ≥ 3n∕4 in the two outer loops in the algorithm.]

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Consider the following algorithm, which takes as input a
sequence of n integers a_1, a_2,… , a_n and produces as output a matrix M = {m_(ij)} where m_(ij) is the minimum term
in the sequence of integers a_i
, a_(i+1),… , a_j for j ≥ i and
m_(ij) = 0 otherwise.
initialize M so that m_(ij) = a_i if j ≥ i and m_(ij) = 0
otherwise
for i := 1 to n
for j := i + 1 to n
for k := i + 1 to j
m_(ij) := min(m_(ij), a_k)
return M= {m_(ij)} {m_(ij) is the minimum term of
a_i
, a_(i+1),… , a_j
}
a) Show that this algorithm uses O(n^3) comparisons to
compute the matrix M.

b) Show that this algorithm uses Ω(n^3) comparisons to
compute the matrix M. Using this fact and part (a),
conclude that the algorithms uses Θ(n^3) comparisons.
[Hint: Only consider the cases where i ≤ n∕4 and
j ≥ 3n∕4 in the two outer loops in the algorithm.]

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Approximation Algorithms
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education