Return a list containing all pairs of distinct elements that satisfy the function fn. We say the pair [a, b] satisfies a function fn when calling fn(a, b) returns True. Also note that the pair [1, 1] should never be included in the final pairing since its elements are not distinct. For example, all the possible pairs with disinct elements of [1, 2, 3] are [1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2] but only [1, 2], [2, 1], [2, 3], [3, 2] satisfy the condition that the sum of their elements is odd. Assume that all elements of lst are distinct. >>> 1st = [1, 2, 3] >>> def sum_to_odd (a, b): ... return (a + b) % 2 == 1 >>> match_pairs (lst, sum_to_odd) # pairs can be returned in any order, this is an example [[1, 2], [2, 1], [2, 3], [3, 2]] More examples can be found in the doctests. def match_pairs (lst, fn): >>> 1st = ["bobby", "frodo", "sally", "kyoko", "beth"] >>> def same_last_char(a, b): return a[-1] == b[-1] BIEL >>> sorted (match_pairs (lst, same_last_char)) # sorted is used for testing [['bobby', 'sally'], ['frodo', 'kyoko'], ['kyoko', 'frodo'], ['sally', 'bobby']] >>> def same_first_char(a, b): return a [0] == b[0] >>> sorted (match_pairs (lst, same_first_char)) [['beth', 'bobby'], ['bobby', 'beth']] HHH "*** YOUR CODE HERE ******"
Return a list containing all pairs of distinct elements that satisfy the function fn. We say the pair [a, b] satisfies a function fn when calling fn(a, b) returns True. Also note that the pair [1, 1] should never be included in the final pairing since its elements are not distinct. For example, all the possible pairs with disinct elements of [1, 2, 3] are [1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2] but only [1, 2], [2, 1], [2, 3], [3, 2] satisfy the condition that the sum of their elements is odd. Assume that all elements of lst are distinct. >>> 1st = [1, 2, 3] >>> def sum_to_odd (a, b): ... return (a + b) % 2 == 1 >>> match_pairs (lst, sum_to_odd) # pairs can be returned in any order, this is an example [[1, 2], [2, 1], [2, 3], [3, 2]] More examples can be found in the doctests. def match_pairs (lst, fn): >>> 1st = ["bobby", "frodo", "sally", "kyoko", "beth"] >>> def same_last_char(a, b): return a[-1] == b[-1] BIEL >>> sorted (match_pairs (lst, same_last_char)) # sorted is used for testing [['bobby', 'sally'], ['frodo', 'kyoko'], ['kyoko', 'frodo'], ['sally', 'bobby']] >>> def same_first_char(a, b): return a [0] == b[0] >>> sorted (match_pairs (lst, same_first_char)) [['beth', 'bobby'], ['bobby', 'beth']] HHH "*** YOUR CODE HERE ******"
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
![Return a list containing all pairs of distinct elements that satisfy the function fn. We say the pair [a, b] satisfies a function
fn when calling fn(a, b) returns True. Also note that the pair [1, 1] should never be included in the final pairing since
its elements are not distinct.
For example, all the possible pairs with disinct elements of [1, 2, 3] are [1, 2], [1, 31, [2, 1], [2, 3], [3, 1],
[3, 2] but only [1, 2], [2, 1], [2, 3], [3, 2] satisfy the condition that the sum of their elements is odd.
Assume that all elements of 1st are distinct.
>>> 1st = [1, 2, 3]
>>> def sum_to_odd (a, b):
***
return (a + b) % 2 == 1
>>> match_pairs (lst, sum_to_odd) # pairs can be returned in any order, this is an example
[[1, 2], [2, 1], [2, 3], [3, 2]]
More examples can be found in the doctests.
def match_pairs (lst, fn):
>>> 1st = ["bobby", "frodo", "sally", "kyoko", "beth"]
>>> def same_last_char(a, b):
return a[-1]
== b[-1]
>>> sorted (match_pairs(lst, same_last_char)) # sorted is used for testing
[['bobby', 'sally'], ['frodo', 'kyoko'], ['kyoko', 'frodo'], ['sally', 'bobby']]
>>> def same_first_char(a, b):
return a [0] == b[0]
>>> sorted (match_pairs(lst, same_first_char))
[['beth', 'bobby'], ['bobby', 'beth']]
||||||
||||||
"*** YOUR CODE HERE ***"](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F866f5711-bb97-4f5c-aba1-0103c07725f6%2F0578d29e-0ecc-4d54-bf55-6e6c4bed9647%2Ffs6ro8n_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Return a list containing all pairs of distinct elements that satisfy the function fn. We say the pair [a, b] satisfies a function
fn when calling fn(a, b) returns True. Also note that the pair [1, 1] should never be included in the final pairing since
its elements are not distinct.
For example, all the possible pairs with disinct elements of [1, 2, 3] are [1, 2], [1, 31, [2, 1], [2, 3], [3, 1],
[3, 2] but only [1, 2], [2, 1], [2, 3], [3, 2] satisfy the condition that the sum of their elements is odd.
Assume that all elements of 1st are distinct.
>>> 1st = [1, 2, 3]
>>> def sum_to_odd (a, b):
***
return (a + b) % 2 == 1
>>> match_pairs (lst, sum_to_odd) # pairs can be returned in any order, this is an example
[[1, 2], [2, 1], [2, 3], [3, 2]]
More examples can be found in the doctests.
def match_pairs (lst, fn):
>>> 1st = ["bobby", "frodo", "sally", "kyoko", "beth"]
>>> def same_last_char(a, b):
return a[-1]
== b[-1]
>>> sorted (match_pairs(lst, same_last_char)) # sorted is used for testing
[['bobby', 'sally'], ['frodo', 'kyoko'], ['kyoko', 'frodo'], ['sally', 'bobby']]
>>> def same_first_char(a, b):
return a [0] == b[0]
>>> sorted (match_pairs(lst, same_first_char))
[['beth', 'bobby'], ['bobby', 'beth']]
||||||
||||||
"*** YOUR CODE HERE ***"
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 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