Reset answer 1 import random 2. 3 def bogo_sort(data): is sorted False while not is sorted: 4 while i c len(data) j- random.randrange(i, len(data)) data[i], data[j] - data[jl, data[i] i + 1 is sorted - True i - 0 while i< len(data) is sorted- is sorted and not data[i]> data[i 1] i + 1 1: 77 8. 10 11 12 1: 13 14 15 16
Reset answer 1 import random 2. 3 def bogo_sort(data): is sorted False while not is sorted: 4 while i c len(data) j- random.randrange(i, len(data)) data[i], data[j] - data[jl, data[i] i + 1 is sorted - True i - 0 while i< len(data) is sorted- is sorted and not data[i]> data[i 1] i + 1 1: 77 8. 10 11 12 1: 13 14 15 16
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
can u modify pls, python thx
![Cournts as one operation every time it is executed.
For example:
Test
Result
random. seed(1)
data - [4, 3, 2, 1] [1, 2, 3, 4]
bogo sort(data)
Number of operations: 1001
print(data)
random. seed (2)
data - (4, 3, 2, 1] [1, 2, 3, 4]
Number of operations: 191
bogo_sort(data)
print (data)
Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %)
Reset answer
1 import random
2
3 def bogo sort(data):
is sorted False
while not is sorted:
4
6.
while i < len(data)
j- random,randrange (i, len(data))
data[i], data[j] - data[j], data[i]
i + 1
is sorted - True
i - 0
while i < len (data)- 1:
is sorted - is sorted and not data[i] > data[i+ 1]
i + 1
77
-1:
8.
9.
10
11
12
13 Y
14
15
16](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3291f4e4-710f-4ff2-b59f-e6861df5a35b%2Faf367a7b-4ccd-4f56-8c12-fce0cf5b09c9%2Fxrqs6u_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Cournts as one operation every time it is executed.
For example:
Test
Result
random. seed(1)
data - [4, 3, 2, 1] [1, 2, 3, 4]
bogo sort(data)
Number of operations: 1001
print(data)
random. seed (2)
data - (4, 3, 2, 1] [1, 2, 3, 4]
Number of operations: 191
bogo_sort(data)
print (data)
Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %)
Reset answer
1 import random
2
3 def bogo sort(data):
is sorted False
while not is sorted:
4
6.
while i < len(data)
j- random,randrange (i, len(data))
data[i], data[j] - data[j], data[i]
i + 1
is sorted - True
i - 0
while i < len (data)- 1:
is sorted - is sorted and not data[i] > data[i+ 1]
i + 1
77
-1:
8.
9.
10
11
12
13 Y
14
15
16
![Given the following function:
import random
def bogo sort (data):
is sorted - False
while not is sorted:
i-0
while i < len(data)
1:
3- random.randrange(1, len(data)
data[i], data[51 - data[j), data[1]
i + 1
is sorted - True
1-0
while i < len(data)
1:
is sorted- is sorted and not data[1]> data[i 1]
1++1
Modify it to count the number of operations performed. The function should print the number of operations formatted as in the examples below,
Note: For simplicity, each line counts as one operation every time it is executed.
For example:
Test
Result
Number of operations: 1001
random. seed(1)
data - (4, 3, 2, 1] [1, 2, 3, 4]
bogo_sort(data)
print(data)
Number of operations: 191
random, seed(2)
data - [4, 3, 2, 1] [1, 2, 3, 4]
bogo_sort(data)
print(data)
20 35 40:45 50%)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3291f4e4-710f-4ff2-b59f-e6861df5a35b%2Faf367a7b-4ccd-4f56-8c12-fce0cf5b09c9%2Fv8iicvj_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Given the following function:
import random
def bogo sort (data):
is sorted - False
while not is sorted:
i-0
while i < len(data)
1:
3- random.randrange(1, len(data)
data[i], data[51 - data[j), data[1]
i + 1
is sorted - True
1-0
while i < len(data)
1:
is sorted- is sorted and not data[1]> data[i 1]
1++1
Modify it to count the number of operations performed. The function should print the number of operations formatted as in the examples below,
Note: For simplicity, each line counts as one operation every time it is executed.
For example:
Test
Result
Number of operations: 1001
random. seed(1)
data - (4, 3, 2, 1] [1, 2, 3, 4]
bogo_sort(data)
print(data)
Number of operations: 191
random, seed(2)
data - [4, 3, 2, 1] [1, 2, 3, 4]
bogo_sort(data)
print(data)
20 35 40:45 50%)
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 3 steps
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