You are to implement a recursive function eto(1st: list[int]) -> list[int] that takes a list of integers 1st and returns a list containing the very same elements except arranged so that all the even numbers appear before all the odd numbers. Among the odd numbers, they can be arranged in any order. Among the even numbers, they can be arranged in any order. All your function needs to make sure is for all even numbers to come before all odd numbers in the list you return.

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...
icon
Related questions
Question
100%

Python: Even Then Odd

You are to implement a recursive function eto(1st: list[int]) -> list[int] that takes a list of
integers 1st and returns a list containing the very same elements except arranged so that all the even
numbers appear before all the odd numbers. Among the odd numbers, they can be arranged in any
order. Among the even numbers, they can be arranged in any order. All your function needs to make
sure is for all even numbers to come before all odd numbers in the list you return.
For example:
• A valid answer for eto([3, 1,2]) is [2,1,3].
• A valid answer for eto ([4, 2,8]) is [8,4,2].
• A valid answer for eto([8,-2,3,-3,-1,5,8,-1,5]) is [8, -2,8,5,-1,5,-1,-3,3].
Restrictions: This will be the only function you'll write. Your function cannot call any other functions
other than itself and basic list manipulation functions.
Transcribed Image Text:You are to implement a recursive function eto(1st: list[int]) -> list[int] that takes a list of integers 1st and returns a list containing the very same elements except arranged so that all the even numbers appear before all the odd numbers. Among the odd numbers, they can be arranged in any order. Among the even numbers, they can be arranged in any order. All your function needs to make sure is for all even numbers to come before all odd numbers in the list you return. For example: • A valid answer for eto([3, 1,2]) is [2,1,3]. • A valid answer for eto ([4, 2,8]) is [8,4,2]. • A valid answer for eto([8,-2,3,-3,-1,5,8,-1,5]) is [8, -2,8,5,-1,5,-1,-3,3]. Restrictions: This will be the only function you'll write. Your function cannot call any other functions other than itself and basic list manipulation functions.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY