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: PEARSON
Bartleby Related Questions Icon

Related questions

Question

please do it in java

Objectives - Tracing the heap sort with max heap and array
Heap sort is the process of two steps:
1. Transform or creating or rebuilding the given array into a max heap.
2. Deleting the max heap and sorting array elements at the same time.
You are given an integer array: {"25", "30", "20", "80", "40", "60"}.
Notes on the sample output:
. The highlight text is to make it easy to see the process. You don't need to do the highlight in
the actual program.
. The tracing text can be placed on the left of the array as long as the display is good spacing
and good alignment.
Sample Output
Processes of Heap Sort on a given integer array
25 30 20 80 40 60 - Original array
80 40 60 30 25 20 - Initial rebuild to form a heap
20 40 60 30 25 80 - After swapping A[0]and A[5]
60 40 20 30 25 80 - After rebuild max heap
25 40 20 30 60 80
40 30 20 25 60 80
25 30 20 40 60 80
30 25 20 40 60 80
P
-After swapping A[0] and A[4]
- After rebuild max heap
-After swapping A[0] and A[3]
- After rebuild max heap
20 25 30 40 60 80 -After swapping A[0] and A[2]
25 20 30 40 60 80 - After rebuild max heap
20 25 30 40 60 80 -After swapping A[0] and A[1]
20 25 30 40 60 80 - Sorted array
expand button
Transcribed Image Text:Objectives - Tracing the heap sort with max heap and array Heap sort is the process of two steps: 1. Transform or creating or rebuilding the given array into a max heap. 2. Deleting the max heap and sorting array elements at the same time. You are given an integer array: {"25", "30", "20", "80", "40", "60"}. Notes on the sample output: . The highlight text is to make it easy to see the process. You don't need to do the highlight in the actual program. . The tracing text can be placed on the left of the array as long as the display is good spacing and good alignment. Sample Output Processes of Heap Sort on a given integer array 25 30 20 80 40 60 - Original array 80 40 60 30 25 20 - Initial rebuild to form a heap 20 40 60 30 25 80 - After swapping A[0]and A[5] 60 40 20 30 25 80 - After rebuild max heap 25 40 20 30 60 80 40 30 20 25 60 80 25 30 20 40 60 80 30 25 20 40 60 80 P -After swapping A[0] and A[4] - After rebuild max heap -After swapping A[0] and A[3] - After rebuild max heap 20 25 30 40 60 80 -After swapping A[0] and A[2] 25 20 30 40 60 80 - After rebuild max heap 20 25 30 40 60 80 -After swapping A[0] and A[1] 20 25 30 40 60 80 - Sorted array
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY