ap 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. u are given an integer array: {"25", "30", "20", "80", "40", "60"}.
ap 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. u are given an integer array: {"25", "30", "20", "80", "40", "60"}.
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
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa38b1750-4836-4d47-bfc9-b05e81f0daae%2Fb4adbffc-b2bc-4989-954c-315c781a2ee5%2Fbdn220h_processed.png&w=3840&q=75)
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
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 with 1 images
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