Design and implement an algorithm that gets as input a list of k integer values N1,...

Design and implement an algorithm that gets as input a list of k integer values N1, N2, …., Nk, as well as a special value SUM. Your algorithm must locate a pair of values in the list N that sum to the value SUM. For example, If your list of values is 3, 8, 13, 2, 17, 18, 10, and the value of SUM is 20, then your algorithm would output either of the two values (2, 18) or (3, 17). If your algorithm cannot find any pair of values that sum to the value of SUM, then it should print the message ‘Sorry there is no such pair of values.’

Expert Solution

please give thumbs up, thanks

sample output:

code:

#required funcion
def FindPair(Values,SUM):
hasfound=False;
for i in Values:
for j in Values:
if (i+j ==SUM):
hasfound=True;
a=i;
b=j;
break;
if(hasfound==True):
break;
if(hasfound==True):
print("(",a,",",b,")");
else:
print("Sorry there is no such pair of values.");

#main to call FindPair Function
def main():
Values=[3,8,13,2,17,18,10];
SUM=20;
FindPair(Values,SUM);

#callinf main functions
main()

venereology answered 2 hours ago

In C ++, Design and implement a program that reads from the user four integer values...

In C ++, Design and implement a program that reads from the user four integer values between 0 and 100, representing grades. The program then, on separate lines, prints out the entered grades followed by the highest grade, lowest grade, and averages of all four grades. Format the outputs following the sample runs below. Sample run 1: You entered: 95, 80, 100, 70 Highest grade: 100 Lowest grade: 70 Average grade: 86.25

Write a program that first gets a list of integers from input. The input begins with...

Write a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain fewer than 20 integers. That list is followed by two more integers representing lower and upper bounds of a range. Your program should output all integers from the list that are within that range (inclusive of the bounds). For coding simplicity, follow each output integer by a space,...

Consider the following algorithm. Algorithm Mystery(n) //Input: A nonnegative integer n S ← 0 for i...

Consider the following algorithm. Algorithm Mystery(n) //Input: A nonnegative integer n S ← 0 for i ← 1 to n do S ← S + i * i return S a. What does this algorithm compute? b. What is its basic operation? c. How many times is the basic operation executed? d. What is the efficiency class of this algorithm? e. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try...

Implement in C++ a GroceryListADT that does the following: gets the input about a grocery item...

Implement in C++ a GroceryListADT that does the following: gets the input about a grocery item (itemName, price, quantity, etc) from the user (from the keyboard)

Use quickselect algorithm to implement the two algorithms for finding the kth smallest integer in a...

Use quickselect algorithm to implement the two algorithms for finding the kth smallest integer in a set of integers. MUST USE JAVA AND QUICKSELECT. Algorithm 1: Procedure SELECT( k,S) { if ISI =1 then return the single element in S else { choose an element randomly from S; let S1, S2, and S3 be the sequences of elements in S less than, equal to, and greater than m, respectively; if IS1I >=k then return SELECT(k,S1) ...

Write, in Python, a recursive algorithm that takes, as input, a positive integer n, and returns,...

Write, in Python, a recursive algorithm that takes, as input, a positive integer n, and returns, as output, the sum of the first n positive odd integers. Your solution should be recursive, and it should not contain any "for" loops or "while" loops.

A Mystery Algorithm Input: An integer n ≥ 1 Output: ?? Find P such that 2...

A Mystery Algorithm Input: An integer n ≥ 1 Output: ?? Find P such that 2 P is the largest power of two less than or equal to n. Create a 1-dimensional table with P +1 columns. The leftmost entry is the Pth column and the rightmost entry is the 0th column. Repeat until P < 0 If 2 P ≤ n then put 1 into column P set n := n − 2 P Else put 0 into column...

Finding duplicate values of an array of integer values. Example 1 Input: arr[] = {5, 2,...

Finding duplicate values of an array of integer values. Example 1 Input: arr[] = {5, 2, 7, 7, 5}, N = 5 Output: Duplicate Element: 5 Duplicate Element: 7 Example 2 Input: arr[] = {1, 2, 5, 5, 6, 6, 7, 2}, N = 8 Output: Duplicate Element: 2 Duplicate Element: 5 Duplicate Element: 6 CODE:: class Main { public static void FindDuplicate(int[] arr){ // write your code to find duplicates here and print those values } ...

A Mystery Algorithm Input: An integer n ≥ 1 Output: ?? Find P such that 2^p...

A Mystery Algorithm Input: An integer n ≥ 1 Output: ?? Find P such that 2^p is the largest power of two less than or equal to n. Create a 1-dimensional table with P +1 columns. The leftmost entry is the Pth column and the rightmost entry is the 0th column. Repeat until P < 0 If 2^p≤n then put 1 into column P set n := n - 2^p Else put 0 into column P End if Subtract 1...

Provide an algorithm that solves the following problem: input: a binary heap B, an integer value...

Provide an algorithm that solves the following problem: input: a binary heap B, an integer value x output: all keys in B that are smaller than x Constraint: your algorithm must run in time O(K), where K is the number of keys output. Explain why your algorithm has the required runtime behaviour. (Use pseudocode or C++, or any informal (but clear) description. You are free to choose any kind of representation of binary heaps, as long as it was mentioned...

Question