Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
For a relatively large n, you sort the numbers 1 to n with insertion sort. The numbers are given in the order: 끌 + 1, 플 + 2, 끝 +3..,n-2,n-1,n, 1,2,3,.. ., -2, 플- 1, 꽃. , 글-2, 골 1, It takes 120 seconds to sort. Next, you sort the (longer) list (1/5 more numbers) 공+ 1, 풍 + 2, 끙 + 3,… 6n ..) 5 - 2, - 1, ,1, 2, 3, 6n 6n n 5 ·2, 끙-1, 품. | ... How long do you expect it to take the new list to sort, in seconds?

For a relatively large n, you sort the numbers 1 to n with insertion sort. The numbers are given in the order: 끌 + 1, 플 + 2, 끝 +3..,n-2,n-1,n, 1,2,3,.. ., -2, 플- 1, 꽃. , 글-2, 골 1, It takes 120 seconds to sort. Next, you sort the (longer) list (1/5 more numbers) 공+ 1, 풍 + 2, 끙 + 3,… 6n ..) 5 - 2, - 1, ,1, 2, 3, 6n 6n n 5 ·2, 끙-1, 품. | ... How long do you expect it to take the new list to sort, in seconds?

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Subject: Java Programming

For a relatively large n, you sort the numbers 1 to n with insertion sort. The numbers are given in the order: 끌 + 1, 플 + 2, 끙 +3..,n-2,n-1,n, 1,2,3,. , -2, -1, - , ...) It takes 120 seconds to sort. Next, you sort the (longer) list (1/5 more numbers) 6n 6n 6n 끙+1, 끙 + 2, 쯤 + 3,. . ,뽑-2, %-1, 똥, 1, 2, 3, , 플 - 2, 끝- 1, . .. How long do you expect it to take the new list to sort, in seconds?
Transcribed Image Text:For a relatively large n, you sort the numbers 1 to n with insertion sort. The numbers are given in the order: 끌 + 1, 플 + 2, 끙 +3..,n-2,n-1,n, 1,2,3,. , -2, -1, - , ...) It takes 120 seconds to sort. Next, you sort the (longer) list (1/5 more numbers) 6n 6n 6n 끙+1, 끙 + 2, 쯤 + 3,. . ,뽑-2, %-1, 똥, 1, 2, 3, , 플 - 2, 끝- 1, . .. How long do you expect it to take the new list to sort, in seconds?
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Mergesort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS