# Building on QotD12, implement randInsert (L, r=1), a new shuffle # routine that removes an randomly chosen element of L and reinserts # it in a random location. This action is repeated r (default 1) # times, to produce a scrambled list. 23 # Example: 23 >>» L=list(range(10)) 23 >>>L * [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] 23 >>> randInsert(L) (0, 1, 2, 3, 5, 4, 6, 7, 8, 9] >>> randInsert(L, 50) [1, 2, е, 3, 5, 4, 6, 7, 8, 9] >>> randInsert(L, 50) 23 [8, е, 9, 7, 2, 5, 6, 1, 3, 4] >>> L [8, е, 9, 7, 2, 5, 6, 1, 3, 4] 23 # Note that your code should both destructively modify the input list, # L, as well as return it. If you are creating new list structure your # code is not correct. Note also that its quite possible to randomly # choose to remove an element and then reinsert it exactly where it # was before. %23 # Hint: you will likely need to use randint from random. Also, review # your list methods. 23 from random import randint def randInsert(L, r-1): pass
# Building on QotD12, implement randInsert (L, r=1), a new shuffle # routine that removes an randomly chosen element of L and reinserts # it in a random location. This action is repeated r (default 1) # times, to produce a scrambled list. 23 # Example: 23 >>» L=list(range(10)) 23 >>>L * [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] 23 >>> randInsert(L) (0, 1, 2, 3, 5, 4, 6, 7, 8, 9] >>> randInsert(L, 50) [1, 2, е, 3, 5, 4, 6, 7, 8, 9] >>> randInsert(L, 50) 23 [8, е, 9, 7, 2, 5, 6, 1, 3, 4] >>> L [8, е, 9, 7, 2, 5, 6, 1, 3, 4] 23 # Note that your code should both destructively modify the input list, # L, as well as return it. If you are creating new list structure your # code is not correct. Note also that its quite possible to randomly # choose to remove an element and then reinsert it exactly where it # was before. %23 # Hint: you will likely need to use randint from random. Also, review # your list methods. 23 from random import randint def randInsert(L, r-1): pass
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
design a function to meet the specification
![# Building on QotD12, implement randInsert (L, r-1), a new shuffle
# routine that removes an randomly chosen element of L and reinserts
# it in a random location. This action is repeated r (default 1)
# times, to produce a scrambled list.
#3
# Example:
23
>>> L=list(range(10))
23
>>> L
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
23
#3
>>> randInsert(L)
#3
(0, 1, 2, 3, 5, 4, 6, 7, 8, 9]
#3
>> randInsert(L, 50)
23
(1, 2, 0, 3, 5, 4, 6, 7, 8,
23
9]
>>> randInsert(L, 50)
[8, е, 9, 7, 2, 5, 6, 1, 3, 4]
#
#
#3
>>> L
[8, е, 9, 7, 2, 5, 6, 1, 3, 4]
#3
# Note that your code should both destructively modify the input list,
# L, as well as return it. If you are creating new list structure your
# code is not correct. Note also that its quite possible to randomly
# choose to remove an element and then reinsert it exactly where it
# was before.
#3
# Hint: you will likely need to use randint from random. Also, review
# your list methods.
#3
from random import randint
def randInsert(L, r-1):
pass](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa44dba20-9098-457f-95f5-31c870b62670%2F5a66791e-b037-4503-b91b-02155af5f8e0%2F399fs7_processed.jpeg&w=3840&q=75)
Transcribed Image Text:# Building on QotD12, implement randInsert (L, r-1), a new shuffle
# routine that removes an randomly chosen element of L and reinserts
# it in a random location. This action is repeated r (default 1)
# times, to produce a scrambled list.
#3
# Example:
23
>>> L=list(range(10))
23
>>> L
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
23
#3
>>> randInsert(L)
#3
(0, 1, 2, 3, 5, 4, 6, 7, 8, 9]
#3
>> randInsert(L, 50)
23
(1, 2, 0, 3, 5, 4, 6, 7, 8,
23
9]
>>> randInsert(L, 50)
[8, е, 9, 7, 2, 5, 6, 1, 3, 4]
#
#
#3
>>> L
[8, е, 9, 7, 2, 5, 6, 1, 3, 4]
#3
# Note that your code should both destructively modify the input list,
# L, as well as return it. If you are creating new list structure your
# code is not correct. Note also that its quite possible to randomly
# choose to remove an element and then reinsert it exactly where it
# was before.
#3
# Hint: you will likely need to use randint from random. Also, review
# your list methods.
#3
from random import randint
def randInsert(L, r-1):
pass
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 3 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