def sort148(Lst: List[int]) -> None: Sort in a non-decreasing order in-place Precondition: items in can only be 1, 4, or 8. >>> ll = [4, 1, 8, 1, 4, 1, 8, 1, 8] >>> sort148(LL) >>> 11 [1, 1, 1, 1, 4, 4, 8, 8, 8] TODO: Complete this function by filling in the BLANKS. Requirements: You must write ONLY ONE Line (without semicolon) for each blank. - You must NOT modify any of the given lines. - The sorting must be IN-PLACE, i.e., the sorting is done by swapping values in the list ONLY. T - You must NOT use any new variable. - YOu must NOT import any other module - You may use the built-in max () and min() functions; you must NOT use any other function (e.g., using sort() will be given 8 marks). Hint: throughout the loop, the list should be divided into two partitions, i.e., the processed (and sorted) partition followed by the unprocessed partition. - p3 is the index of the first item in the unprocessed partition. - pl and p2 should represent something related to the starting positions of different numbers in the processed partition
def sort148(Lst: List[int]) -> None: Sort in a non-decreasing order in-place Precondition: items in can only be 1, 4, or 8. >>> ll = [4, 1, 8, 1, 4, 1, 8, 1, 8] >>> sort148(LL) >>> 11 [1, 1, 1, 1, 4, 4, 8, 8, 8] TODO: Complete this function by filling in the BLANKS. Requirements: You must write ONLY ONE Line (without semicolon) for each blank. - You must NOT modify any of the given lines. - The sorting must be IN-PLACE, i.e., the sorting is done by swapping values in the list ONLY. T - You must NOT use any new variable. - YOu must NOT import any other module - You may use the built-in max () and min() functions; you must NOT use any other function (e.g., using sort() will be given 8 marks). Hint: throughout the loop, the list should be divided into two partitions, i.e., the processed (and sorted) partition followed by the unprocessed partition. - p3 is the index of the first item in the unprocessed partition. - pl and p2 should represent something related to the starting positions of different numbers in the processed partition
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Part 1
![def sort148(Lst: List[int]) -> None:
Sort <lst> in a non-decreasing order in-place
Precondition: items in <lst> can only be 1, 4, or 8.
>>> ll = [4, 1, 8, 1, 4, 1, 8, 1, 8]
>>> sort148(LL)
>>> lL
[1, 1, 1, 1, 4, 4, 8, 8, 8]
TODO: Complete this function by filling in the BLANKS.
Requirements:
- You must write ONLY ONE Line (without semicolon) for each blank.
- You must NOT modify any of the given lines.
- The sorting must be IN-PLACE, i.e., the sorting is done by swapping
values in the list ONLY.
- You must NOT use any new variable.
- YOu must NOT import any other module
- You may use the built-in max() and min() functions; you must NOT use
any other function (e.g., using sort() will be given 8 marks).
Hint: throughout the loop, the list should be divided into two partitions,
1.e., the processed (and sorted) partition followed by the unprocessed
partition.
- p3 is the index of the first item in the unprocessed partition.
- pl and p2 should represent something related to the starting positions
of different numbers in the processed partition](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F50700bcb-7eae-4627-8f9a-d21c0cbd1fac%2F089d199c-9d01-4b88-97b1-bbc34c191244%2Ftyk3xxj_processed.png&w=3840&q=75)
Transcribed Image Text:def sort148(Lst: List[int]) -> None:
Sort <lst> in a non-decreasing order in-place
Precondition: items in <lst> can only be 1, 4, or 8.
>>> ll = [4, 1, 8, 1, 4, 1, 8, 1, 8]
>>> sort148(LL)
>>> lL
[1, 1, 1, 1, 4, 4, 8, 8, 8]
TODO: Complete this function by filling in the BLANKS.
Requirements:
- You must write ONLY ONE Line (without semicolon) for each blank.
- You must NOT modify any of the given lines.
- The sorting must be IN-PLACE, i.e., the sorting is done by swapping
values in the list ONLY.
- You must NOT use any new variable.
- YOu must NOT import any other module
- You may use the built-in max() and min() functions; you must NOT use
any other function (e.g., using sort() will be given 8 marks).
Hint: throughout the loop, the list should be divided into two partitions,
1.e., the processed (and sorted) partition followed by the unprocessed
partition.
- p3 is the index of the first item in the unprocessed partition.
- pl and p2 should represent something related to the starting positions
of different numbers in the processed partition
![Below, you're given a partially completed function sort148() that sorts a list
containing items that can only be 1, 4, or 8.
Fill in the missing lines in the blanks to make the code work correctly.
limport
# No other import is allowed
def sort148(lst: List[int]) -> None:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F50700bcb-7eae-4627-8f9a-d21c0cbd1fac%2F089d199c-9d01-4b88-97b1-bbc34c191244%2Fxvqubnf_processed.png&w=3840&q=75)
Transcribed Image Text:Below, you're given a partially completed function sort148() that sorts a list
containing items that can only be 1, 4, or 8.
Fill in the missing lines in the blanks to make the code work correctly.
limport
# No other import is allowed
def sort148(lst: List[int]) -> None:
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 2 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY