5. sort friends_by_name_length In this function, we will again take a list of friend dictionaries (just like the previous problem), and we will return a new list where we have ordered the friends by the length of their names, decreasing. Don't worry about breaking ties. Make sure you create a new output list, and make sure not to destroy the input list! I recommend using slicing to copy the input list and then repeatedly calling find friend_with_longest_name to figure out who to put in the output list next. (note -- you'll have to find some way to remove each friend from the list of unsorted friends too) Sample runs should look like: >>> my_friends [{'name': 'bimmy', 'height': 60}, {'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}] >>> sort_friends_by_name_length(my_friends) [{'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}, {'name': 'bimmy', 'height': 60}] >>> my_friends [{'name': 'bimmy', 'height': 60}, {'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}]
5. sort friends_by_name_length In this function, we will again take a list of friend dictionaries (just like the previous problem), and we will return a new list where we have ordered the friends by the length of their names, decreasing. Don't worry about breaking ties. Make sure you create a new output list, and make sure not to destroy the input list! I recommend using slicing to copy the input list and then repeatedly calling find friend_with_longest_name to figure out who to put in the output list next. (note -- you'll have to find some way to remove each friend from the list of unsorted friends too) Sample runs should look like: >>> my_friends [{'name': 'bimmy', 'height': 60}, {'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}] >>> sort_friends_by_name_length(my_friends) [{'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}, {'name': 'bimmy', 'height': 60}] >>> my_friends [{'name': 'bimmy', 'height': 60}, {'name': 'Ian Donald Calvin Euclid Zappa', 'height': 175}]
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
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!
Trending now
This is a popular solution!
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