are given an array segments consisting of ntegers denoting the lengths of several segments. Your ask is to find among them four segments from which a ectangle can be constructed. What is the minimum absolute difference between the side lengths of the constructed rectangle?
are given an array segments consisting of ntegers denoting the lengths of several segments. Your ask is to find among them four segments from which a ectangle can be constructed. What is the minimum absolute difference between the side lengths of the constructed rectangle?
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
Related questions
Question
![You are given an array segments consisting of N
integers denoting the lengths of several segments. Your
task is to find among them four segments from which a
rectangle can be constructed. What is the minimum.
absolute difference between the side lengths of the
constructed rectangle?
Write a function:
int solution (intl segments); that, given an array
segments, returns the minimum absolute difference
between the side lengths of the constructed rectangle
or -1 if no rectangle can be constructed.
Examples:
1. For segments = [2, 2, 2, 2, 21, we can construct only a
2 x2 rectangle out of the given segments. The function
should return O.
2. For segments = [911, 1, 3, 1000, 1000, 2, 2, 999,
1000, 911, we can construct three rectangles: 2 x 911, 2
x 1000, and 911 x 1000. Out of those three possibilities,
the best one is 911 x 1000. The function should return
89.
3. For segments = [4, 1, 1, 1, 3], we cannot construct any
rectangle out of the given segments. The function
should return -1.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbd641789-b1c8-4fcc-b12a-ca224e1ad6e1%2F677c3dea-997a-4f9a-ba94-4d23764698ff%2Frlb451_processed.jpeg&w=3840&q=75)
Transcribed Image Text:You are given an array segments consisting of N
integers denoting the lengths of several segments. Your
task is to find among them four segments from which a
rectangle can be constructed. What is the minimum.
absolute difference between the side lengths of the
constructed rectangle?
Write a function:
int solution (intl segments); that, given an array
segments, returns the minimum absolute difference
between the side lengths of the constructed rectangle
or -1 if no rectangle can be constructed.
Examples:
1. For segments = [2, 2, 2, 2, 21, we can construct only a
2 x2 rectangle out of the given segments. The function
should return O.
2. For segments = [911, 1, 3, 1000, 1000, 2, 2, 999,
1000, 911, we can construct three rectangles: 2 x 911, 2
x 1000, and 911 x 1000. Out of those three possibilities,
the best one is 911 x 1000. The function should return
89.
3. For segments = [4, 1, 1, 1, 3], we cannot construct any
rectangle out of the given segments. The function
should return -1.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images

Knowledge Booster
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.Recommended textbooks for you

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education