Write and instrument Insertion Sort and Shellsort programs to sort arrays of positive integers. The Shellsort program should use four sets of increments: {1.72n'/3, 1} {2' – 1|1
Write and instrument Insertion Sort and Shellsort programs to sort arrays of positive integers. The Shellsort program should use four sets of increments: {1.72n'/3, 1} {2' – 1|1
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
How do I solve this in C Program?
![Write and instrument Insertion Sort and Shellsort programs to sort arrays of positive integers.
The Shellsort program should use four sets of increments:
{1.72n/3,1}
{2' – 1|1<i < [logn]}
{2' | 0 < i < [logn]}
|1si s t where t is the smallest integer such that
3t+2–1
2
All integers on the list, which may include duplicates, will lie between 1 and 1,024,000. Use a
random number generator to generate the input files and use the same list for each set of
increments.
Test your programs on arrays of 25,000, 100,000, and 500,000 integers. Use the timing
functions available in C to time the work done by each algorithm, with each set of increments
(not including I/O). Compare the timings on each list. How do the results compare with those
predicted by an analysis of shellsort and insertion sort?
Does the number of key comparisons give a realistic measure of the amount of work done?
(You may want to count the number of comparisons and exchanges done by each algorithm on
each list.) Which set of increments gave the best times? Explain your results and any
discrepancies between predicted and actual results.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8cb58778-70ba-4f7e-90ce-7267bd79a013%2F6ac6d38f-9780-41c8-9497-2f6e6bf079b0%2Ft3nfpmh_processed.png&w=3840&q=75)
Transcribed Image Text:Write and instrument Insertion Sort and Shellsort programs to sort arrays of positive integers.
The Shellsort program should use four sets of increments:
{1.72n/3,1}
{2' – 1|1<i < [logn]}
{2' | 0 < i < [logn]}
|1si s t where t is the smallest integer such that
3t+2–1
2
All integers on the list, which may include duplicates, will lie between 1 and 1,024,000. Use a
random number generator to generate the input files and use the same list for each set of
increments.
Test your programs on arrays of 25,000, 100,000, and 500,000 integers. Use the timing
functions available in C to time the work done by each algorithm, with each set of increments
(not including I/O). Compare the timings on each list. How do the results compare with those
predicted by an analysis of shellsort and insertion sort?
Does the number of key comparisons give a realistic measure of the amount of work done?
(You may want to count the number of comparisons and exchanges done by each algorithm on
each list.) Which set of increments gave the best times? Explain your results and any
discrepancies between predicted and actual results.
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
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