You are given an array segments consisting of Nintegers denoting the lengths of several segments. Yourtask is to find among them four segments from which arectangle can be constructed. What is the minimum.absolute difference between the side lengths of theconstructed rectangle?Write a function:int solution (intl segments); that, given an arraysegments, returns the minimum absolute differencebetween the side lengths of the constructed rectangleor -1 if no rectangle can be constructed.Examples:1. For segments = [2, 2, 2, 2, 21, we can construct only a2 x2 rectangle out of the given segments. The functionshould return O.2. For segments = [911, 1, 3, 1000, 1000, 2, 2, 999,1000, 911, we can construct three rectangles: 2 x 911, 2x 1000, and 911 x 1000. Out of those three possibilities,the best one is 911 x 1000. The function should return89.3. For segments = [4, 1, 1, 1, 3], we cannot construct anyrectangle out of the given segments. The functionshould return -1.

Solution- We have created a C++ code for the about problem in which we are give an array segments…

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

See similar textbooks

Related questions

Q: Can you help me solve this and explain it step by step on how the answer was found please. Given…

A: The function at(i) returns the reference of the element at position i in the vector. Hence, if the…

Q: Imagine you have a square matrix, where each cell (pixel) is either black or white. Design an…

A: We are aware that there is only one square of dimension NxN and that the largest feasible square has…

Q: We want to determine if an unsorted array A of n entries has duplicates. These integers are 1,...,…

A: To determine if an unsorted array A of n entries has duplicates, we can use a simple approach based…

Q: Question 2.An array containing the given n-element integers and the sum of the consecutive elements…

A: import java.util.*; public class Question2 { int[] arr; public Question2(int [] input) {…

Q: Given an array of integers, write a function to find the subarray with the largest sum. What is the…

A: One way to solve this problem is by using Kadane's algorithm, which has a time complexity of O(n).…

Q: generate intger random number ranged (1,100) in matrix(a(1,100)). The find the Index and number in…

A: Since no programming language is mentioned, I am using matlab Code: a=randi([1,100],1,100)for…

Q: Any-Segment-Intersect() is an algorithm that checks whether any pair of n given line segments…

A: Note :- Below i explain the answer in my own words by which you understand it well. In this…

Q: We are given ages of 10 people from a random sample of population. The task is to find the sum of…

A: ALGORITHM:- 1. Take input for the 10 ages from user. 2. Store them in array. 3. Sort the array. 4.…

Q: Suppose that queue is a queueType object and the size of the array imple- menting queue is 100.…

A: In queue we take 2 variables front and rear and initially set them to -1

Q: Recall that the volume of a right circular cylinder with height h and radius r is given by V =…

A: The complete answer in MATLAB is below:

Q: This code segment determine an average of even elements of Array T(50). s=0:c=0 For I=1 To 50…

A: Ans :The code segment determine an average of even elements of array T(50): s = 0: c=0 For I = 1 To…

Q: Given a vector of integers. Find the number of elements which are out of order in the array. An…

A: Given: Vector of integers v. To Find: Number of elements which are out of order in the vector.…

Q: Given a 5x5 two-dimensional array A and a number X, Find the occurrence X in array A

A: Since no programming language was mentioned, the provided solution is in the C++ programming…

Q: You're given an array of N integers, and a number K. The maximum K-product of the array is the…

A: Coded using Java.

Q: Check if Array with mean X can be made using N elements of given Array

A: Given: The aim is to determine whether it is possible to generate an array using N different members…

Q: A post on facebook is said to be more popular if the number of likes on the post is strictly greater…

A: To solve this problem, you can iterate through the arrays A and B and compare the number of likes…

Q: 4, 10, 15, 18, 23, 26, 30, 34, 40

A: We have chosen a problem which is locating a number within an array. we'll be working with the…

Q: You are given an integer array X[1, . . . , n]. You should move each element of X[1, . . . , n] into…

A: Pseudocode is a computing tool that aids in problem-solving before a programme is written in a…

Q: Describe an algorithm for finding the 10 largest elements in an array of size n. What is the running…

A: Flowchart to find the 10 largest numbers in the array of size n :

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.

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

Given an array A[0…n-1] , where each element of the array represents a vote in the election. Assume that each vote is given as an integer representing the ID of the chosen candidate. Implementan algorithm for determining who wins the election.
Write an algorithm that applies right shift on one dimensional array (trace your algorithm on example array A:[0,9,2,10,3] and show the result of your trace steps as a table). (Do not use extra array while solving this problem)
Solve using Polya's Method
Given two arrays a and b, where both arrays consisting of n positive integers. It is allowed to swap any element from array a with any element from b. Your task is to find the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k moves (swaps). Input • The first line of the test case contains two integers n and k (1Sns30;0sksn) - where n is the number of elements in a and b, while k is the maximum number of moves you can do. • The second line of the test case contains n integers a1,a2,... an • The third line of the test case contains n integers b1,b2,..,bn Output Print the answer – the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k swaps. Examples: Ex 1: Ex 2: Ex 3: Input 55 53 40 55665 1234 5 2243 12543 10 9 10 10 9 2423 Output: 27 39 11 • In the first test case of the example, you don't need to swap anything. • In the second test case of the example, you can swap a1=1 with bi=10, a3=3 with b3=10…
Check if Array with mean X can be made using N elements of given Array