Algorithm Analysis 1. Revises the function quickSort so that it always chooses the first item in the array as the pivot. Add a counter to the function partition that counts the number of comparisons that are made. Compare the behavior of the revised function with the original one (pivot should be selected using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the difference in the number of comparisons become significant? For which pivot selection strategy does the difference in the number of comparisons become significant? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 and clock() function.). For comparison, you need to create two tables for execution times and a counter for both algorithms. 2. Revises the function quickSort so that it always chooses the last item in the array as the pivot. Add a counter to the function partition that counts the number of comparisons that are made. Compare the behavior of the revised function with the original one (pivot should be selected using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the difference in the number of comparisons become significant? For which pivot selection strategy does the difference in the number of comparisons become significant? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 and clock() function. For comparison, you need to create two tables for execution times and a counter for both algorithms.

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...
icon
Related questions
Question

Algorithm Analysis
1. Revises the function quickSort so that it always chooses the first item in the array as the pivot.
Add a counter to the function partition that counts the number of comparisons that are made.
Compare the behavior of the revised function with the original one (pivot should be selected
using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the
difference in the number of comparisons become significant? For which pivot selection strategy
does the difference in the number of comparisons become significant? Compare your analysis
with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64,
128, 256, 512, 1024, 2048, 8192, 16384 <time.h> and clock() function.). For comparison, you
need to create two tables for execution times and a counter for both algorithms.
2. Revises the function quickSort so that it always chooses the last item in the array as the pivot.
Add a counter to the function partition that counts the number of comparisons that are made.
Compare the behavior of the revised function with the original one (pivot should be selected
using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the
difference in the number of comparisons become significant? For which pivot selection strategy
does the difference in the number of comparisons become significant? Compare your analysis
with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64,
128, 256, 512, 1024, 2048, 8192, 16384 <time.h> and clock() function. For comparison, you
need to create two tables for execution times and a counter for both algorithms.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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