Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The runtime of bubblesort is roughtly proportional to n2 , where n is the list size. The runtime of mergesort is roughtly proportional to nlogn,where n is the list size. Suppose we run bubblesort on a fast computer and mergesort on a fast computer, so they both take the same time to sort a list of size 1000. Will the runtimes still be the same when we increase the list size to 1,000,000? Justify your answer.

The runtime of bubblesort is roughtly proportional to n2 , where n is the list size. The runtime of mergesort is roughtly proportional to nlogn,where n is the list size. Suppose we run bubblesort on a fast computer and mergesort on a fast computer, so they both take the same time to sort a list of size 1000. Will the runtimes still be the same when we increase the list size to 1,000,000? Justify your answer.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

Correct and detailed answer will be Upvoted else downvoted. Thank you!

The runtime of bubblesort is roughtly proportional to n<, where n is the list size. The runtime of mergesort is roughtly proportional to nlogn,where n is the list size. Suppose we run bubblesort on a fast computer and mergesort on a fast computer, so they both take the same time to sort a list of size 1000. Will the runtimes still be the same when we increase the list size to 1,000,000? Justify your answer.
Transcribed Image Text:The runtime of bubblesort is roughtly proportional to n<, where n is the list size. The runtime of mergesort is roughtly proportional to nlogn,where n is the list size. Suppose we run bubblesort on a fast computer and mergesort on a fast computer, so they both take the same time to sort a list of size 1000. Will the runtimes still be the same when we increase the list size to 1,000,000? Justify your answer.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS