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?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

A football team plays a football game almost every month. It stores the number of goals scoredper month in an array of size 12. The number of goals scored on January is stored in the firstelement of the array (at index 0). The number of goals scored on February is stored in the 2ndelement of the array (at index 1) and so on.a. The team wants to find the month in which they scored the maximum number of goals.Write a function named String Max(int[] A) that takes the array of goals and returnsthe month name (a string value) in which they scored the maximum number of goals.b. The team wants to find the number of games played during the year. Note that if theteam didn’t play a game in a specific month, the value -1 is found. Write a function intNbGames(int[] A) to count the number of games played during the year.c. Write a program in which you create an array of size 12 having all its elementsinitialized to -1. Then ask the user to enter a month number and the number of goalsscored in that…
There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. Example There is one pair of color and one of color . There are three odd socks left, one of each color. The number of pairs is . Function Description Complete the sockMerchant function in the editor below. sockMerchant has the following parameter(s): int n: the number of socks in the pile int ar[n]: the colors of each sock Returns int: the number of pairs Input Format The first line contains an integer , the number of socks represented in .The second line contains space-separated integers, , the colors of the socks in the pile. Constraints where Sample Input STDIN Function ----- -------- 9 n = 9 10 20 20 10 10 30 50 10 20 ar = [10, 20, 20, 10, 10, 30, 50, 10, 20] Sample Output 3
There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. Example There is one pair of color and one of color . There are three odd socks left, one of each color. The number of pairs is . Function Description Complete the sockMerchant function in the editor below. sockMerchant has the following parameter(s): int n: the number of socks in the pile int ar[n]: the colors of each sock Returns int: the number of pairs Input Format The first line contains an integer , the number of socks represented in .The second line contains space-separated integers, , the colors of the socks in the pile. Constraints where Sample Input STDIN Function ----- -------- 9 n = 9 10 20 20 10 10 30 50 10 20 ar = [10, 20, 20, 10, 10, 30, 50, 10, 20] Sample Output 3 Explanation There are three pairs of socks.
b=3 (my number)
Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost- palindromes, respectively. Examples since they can be rearranged to form 767 and 383, palindromeSieve([443, 12, 639, 121, 3232]) → [443, 121, 323 // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3:
Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3223 palindromeSieve([5, 55, 6655, 8787]) → [5, 55, 6655, 8787] // Single-digit numbers are automatically palindromes. palindromeSieve ([897, 89, 23, 54, 6197, 53342]) - []
Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost- palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] palindromeSieve ([5, 55, 6655, 8787]) - [5, 55, 6655, 8787] palindromeSieve ([897, 89, 23, 54, 6197, 53342]) []
Given a array oranges. v Oranges[i]=1 represents orange is fresh. Oranges[i]=0 represents orange is rotten. Write a function that takes the array and array size as parameter and print the number of fresh and rotten oranges. In C++. Test the function using the array oaranges[ ]+
please write code for a function that accepts an array of 50 points (from x=0.3 to x=9.6) and a second input(a point that a user wants to be interpolated) and returns the newton forward and backward polynomial values for eac
Write a function averageCatAge() that takes an array of cat structs (cat* a_cats) and the size of the array (unsigned int numCats) as input parameters. The function then returns the mean or average age for all the cats...the average is ..... the sum of values divided by the number of valueS just in case you forgot. The average returned is a double.
For this assignment you will be replicating the game of Roshambo (aka rock, paper, scissors). Please answer both parts a and b of the following question below. Show the R code in your answer and annotate all parts of the code. a.) First, you need to come up with a strategy to win the game. Write a function in R that takes in a vector of past plays for your opponent (each play should be represented as "R", "P", or "S") and outputs the next move ("R", "P", or "S"). Your strategy should at least depend on the last two moves used, but you should return a random move if there is not enough past history to use the strategy. b.) Now, play your strategy against a random player who uses rock, paper, or scissors with 1/3 probability each. Who wins the most rounds after 100 rounds of play? Write a function in R.
Given an array of products ["Apple", "Banana", "Cucumber", "Watermelon", "Ice-cream", "Orange", "Eggplant", "Egg") Write functions that: 1. Takes an array as parameter and prints out all products starting with any of these letters (A,E,I,0,U) 2. Takes an array as parameter and prints out all products with names longer than 5 characters