Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
59 views2 pages

Example: 1. Build The Heap Heap Newly Added Element Swap Elements

1. The list {6, 5, 3, 1, 8, 7, 2, 4} is sorted from smallest to largest using heapsort. 2. First, a max heap is built from the list. Then elements are removed from the heap one by one and added to the sorted array. 3. Each removal involves swapping the max element (root) with the last element, deleting it, and rebuilding the heap from the remaining elements. This continues until the heap is empty and the list is fully sorted.

Uploaded by

dinesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
59 views2 pages

Example: 1. Build The Heap Heap Newly Added Element Swap Elements

1. The list {6, 5, 3, 1, 8, 7, 2, 4} is sorted from smallest to largest using heapsort. 2. First, a max heap is built from the list. Then elements are removed from the heap one by one and added to the sorted array. 3. Each removal involves swapping the max element (root) with the last element, deleting it, and rebuilding the heap from the remaining elements. This continues until the heap is empty and the list is fully sorted.

Uploaded by

dinesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Example

Let { 6, 5, 3, 1, 8, 7, 2, 4 } be the list that we want to sort from the smallest to the largest

1. Build the heap

Heap newly added element swap elements


nil 6
6 5
6, 5 3
6, 5, 3 1
6, 5, 3,1 8
6, 5, 3, 1, 8 5, 8
6, 8, 3, 1, 5 6, 8
8, 6, 3, 1, 5 7
8, 6, 3, 1, 5, 7 3, 7
8, 6, 7, 1, 5, 3 2
8, 6, 7, 1, 5, 3, 2 4
8, 6, 7, 1, 5, 3, 2, 4 1, 4
8, 6, 7, 4, 5, 3, 2, 1
2. Sorting.

swap delete
Heap sorted array details
elements element
8, 6, 7, 4, 5, 3, 2,
8, 1 swap 8 and 1 in order to delete 8 from heap
1
1, 6, 7, 4, 5, 3, 2,
8 delete 8 from heap and add to sorted array
8
swap 1 and 7 as they are not in order in the
1, 6, 7, 4, 5, 3, 2 1, 7 8
heap
swap 1 and 3 as they are not in order in the
7, 6, 1, 4, 5, 3, 2 1, 3 8
heap
7, 6, 3, 4, 5, 1, 2 7, 2 8 swap 7 and 2 in order to delete 7 from heap
2, 6, 3, 4, 5, 1, 7 7 8 delete 7 from heap and add to sorted array
swap 2 and 6 as they are not in order in the
2, 6, 3, 4, 5, 1 2, 6 7, 8
heap
swap 2 and 5 as they are not in order in the
6, 2, 3, 4, 5, 1 2, 5 7, 8
heap
6, 5, 3, 4, 2, 1 6, 1 7, 8 swap 6 and 1 in order to delete 6 from heap
1, 5, 3, 4, 2, 6 6 7, 8 delete 6 from heap and add to sorted array
swap 1 and 5 as they are not in order in the
1, 5, 3, 4, 2 1, 5 6, 7, 8
heap
swap 1 and 4 as they are not in order in the
5, 1, 3, 4, 2 1, 4 6, 7, 8
heap
5, 4, 3, 1, 2 5, 2 6, 7, 8 swap 5 and 2 in order to delete 5 from heap
2, 4, 3, 1, 5 5 6, 7, 8 delete 5 from heap and add to sorted array
swap 2 and 4 as they are not in order in the
2, 4, 3, 1 2, 4 5, 6, 7, 8
heap
4, 2, 3, 1 4, 1 5, 6, 7, 8 swap 4 and 1 in order to delete 4 from heap
1, 2, 3, 4 4 5, 6, 7, 8 delete 4 from heap and add to sorted array
swap 1 and 3 as they are not in order in the
1, 2, 3 1, 3 4, 5, 6, 7, 8
heap
3, 2, 1 3, 1 4, 5, 6, 7, 8 swap 3 and 1 in order to delete 3 from heap
1, 2, 3 3 4, 5, 6, 7, 8 delete 3 from heap and add to sorted array
swap 1 and 2 as they are not in order in the
1, 2 1, 2 3, 4, 5, 6, 7, 8
heap
2, 1 2, 1 3, 4, 5, 6, 7, 8 swap 2 and 1 in order to delete 2 from heap
1, 2 2 3, 4, 5, 6, 7, 8 delete 2 from heap and add to sorted array
1 1 2, 3, 4, 5, 6, 7, 8 delete 1 from heap and add to sorted array
1, 2, 3, 4, 5, 6,
completed
7,8

You might also like