You have an array of n real numbers and another integer s. Find out whether the array contains two elements whose sum is s. (For example, for the array 5, 9, 1, 3 and s = 6, the answer is yes, but for the same array and s = 7, the answer is no.) Design an algorithm for this problem with a better than quadratic time efficiency.

You have an array of n real numbers and another integer s. Find out whether the array contains two elements whose sum is s. (For example, for the array 5, 9, 1, 3 and s = 6, the answer is yes, but for the same array and s = 7, the answer is no.) Design an algorithm for this problem with a better than quadratic time efficiency.

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 24PE

See similar textbooks

Similar questions

Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
You have an array of 10,000 subject scores for a high-school exam and you want to find the scores that are ranked from 4900 to 5100 that is the 201 most middle-ranked scores. Precisely describe two alternative algorithmic ap proaches to doing this - one of which is, in terms of time complexity, more efficient than the other.
You have an array containing the heights of n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Your task is to find the maximum volume of liquid that can hold by these lines. Program Specification: Language: Java Time Complexity: O(n) Space Complexity: 0(1)
solve it with java and explain each step We are given ages of 10 people from a random sample of population. The task is to find the sum of three eldest ages in the given sample of population u Input An Array consists of ages of 10 citizens. uOutput A number consist of sum of ages of three eldest citizens. Sample Input u55, 82, 54, 60, 15, 98, 38, 29, 13, 90 uSample Output 270
Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two. She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i + 1], for i = 0, 1,..., (n/2) – 1. If B has size 1, then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of her algorithm?
Describe an O(n) algorithm that does the following: Given an input array of n integers lying in the range 0 .. 3n - 1, the algorithm outputs the first integer that occurs in the array only once. (You may assume that each input array contains at least one number that has no duplicates in the array.) Explain why your algorithm has an O(n) running time. Example: If the input array is [1, 2, 4, 9, 3, 2, 1, 4, 5], then the return value is 9 since 9 is the first integer that occurs in the array only once. I
Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses constant extra space. Example 1: Input: nums = [1,2,0] Output: 3 Explanation: The numbers in the range [1,2] are all in the array. Example 2: Input: nums = [3,4,-1,1] Output: 2 Explanation: 1 is in the array but 2 is missing. Example 3: Input: nums = [7,8,9,11,12] Output: 1 Explanation: The smallest positive integer 1 is missing. Solve it in C# language please
Consider an array A[ ] of n integers: all numbers are distinct and the array increases until a number (which is the maximum), and then decreases. For example, if the array is A[ ] = {2, 5, 7, 9, 13, 10, 8, 1}, then the maximum is 13. Give an O(log n) time algorithm to find the maximum. Write pseudo-code.
Consider a group of balls where each ball is one of k colors. You can assume that there is an equal number of balls of each color. Each ball, aside from its color, has a written integer on it. The numbers are in no way associated with the color. a) Devise an algorithm that orders all the balls according to colors in a way that no ball comes before a ball of a lighter color. In other words, how do you order balls from lightest to darkest, however, inside one group (i. e., one color), balls can be ordered in any way with respect to the number written on the ball. Design an algorithm and analyze it. b) Now take the output from (a), and also order balls within the color. How much time is needed for this step?
Implement a program that reads two integers (n and k). The program must output the binomial coefficient as follows: Print every coefficient that is before binomial coefficient for given k; Example: Insert n: 5 Insert k: 3 Result: 10 Coefficient-array: 1 5 10 10 Print Pascal Triangle for the given n: Example (n=5): 1 11 121 1331 14641 15 10 10 5 1
You are a movie theater manager. You are given a two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array, by 1 and outputs the resulting matrix. Use nested for-loops to iterate over two-dimensional matrix.
A wrestling tournament has 256 players. Each match includes 2 players. The winner each match will play another winner in the next round. The tournament is single elimination, so no one will wrestle after they lose. The 2 players that are undefeated play in the final game, and the winner of this match wins the entire tournament. How would you determine the winner? Here is one algorithm to answer this question. Compute 256/2 = 128 to get the number of pairs (matches) in the first round, which results in 128 winners to go on to the second round. Compute 128/2 = 64, which results in 64 matches in the second round and 64 winners, to go on to the third round. For the third round compute 64/2 = 32, so the third round has 64 matches, and so on. The total number of matches is 128 + 64 + 32+ .... Finish this process to find the total number of matches.