Heapsort example - University of Cambridge...heapify(6) QWERTY[U]IOPASDFG Q W R I O T P A E Y S D U...

Heapsort example

Andrej Ivaskovic

University of Cambridge

February 1, 2015

Andrej Ivaskovic (University of Cambridge) Heapsort example February 1, 2015 1 / 25

InputInitial state of the heap

We are given an array that needs to be sorted:

QWERTYUIOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G


Making the array satisfy the max-heap propertyheapify(6)

QWERTY[U]IOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G



QWERT[Y]UIOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G



QWER[T]YUIOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G



QWE[R]TYUIOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G



QW[E]RTYUIOPASDFG

Q

W

R

I O

T

P A

E

Y

S D

U

F G



QW[Y]RTEUIOPASDFG

Q

W

R

I O

T

P A

Y

E

S D

U

F G



QW[Y]RTSUIOPAEDFG

Q

W

R

I O

T

P A

Y

S

E D

U

F G



Q[W]YRTSUIOPAEDFG

Q

W

R

I O

T

P A

Y

S

E D

U

F G



[Q]WYRTSUIOPAEDFG

Q

W

R

I O

T

P A

Y

S

E D

U

F G



[Y]WQRTSUIOPAEDFG

Y

W

R

I O

T

P A

Q

S

E D

U

F G



[Y]WURTSQIOPAEDFG

Y

W

R

I O

T

P A

U

S

E D

Q

F G


End of step 1We have a heap!

Now the array satisfies the binary max-heap property:

YWURTSQIOPAEDFG

Y

W

R

I O

T

P A

U

S

E D

Q

F G


Removal of elements from the heapWe have the 14th element!

[G]WURTSQIOPAEDFY

G

W

R

I O

T

P A

U

S

E D

Q

F Y



GWURTSQIOPAEDFY

G

W

R

I O

T

P A

U

S

E D

Q

F Y



WGURTSQIOPAEDFY

W

G

R

I O

T

P A

U

S

E D

Q

F Y



WTURGSQIOPAEDFY

W

T

R

I O

G

P A

U

S

E D

Q

F Y



WTURPSQIOGAEDFY

W

T

R

I O

P

G A

U

S

E D

Q

F Y



[F]TURPSQIOGAEDWY

F

T

R

I O

P

G A

U

S

E D

Q

W Y



FTURPSQIOGAEDWY

F

T

R

I O

P

G A

U

S

E D

Q

W Y



UTFRPSQIOGAEDWY

U

T

R

I O

P

G A

F

S

E D

Q

W Y



UTSRPFQIOGAEDWY

U

T

R

I O

P

G A

S

F

E D

Q

W Y



[D]TSRPFQIOGAEUWY

D

T

R

I O

P

G A

S

F

E U

Q

W Y



DTSRPFQIOGAEUWY

D

T

R

I O

P

G A

S

F

E U

Q

W Y



TDSRPFQIOGAEUWY

T

D

R

I O

P

G A

S

F

E U

Q

W Y



TRSDPFQIOGAEUWY

T

R

D

I O

P

G A

S

F

E U

Q

W Y



TRSOPFQIDGAEUWY

T

R

O

I D

P

G A

S

F

E U

Q

W Y



[E]RSOPFQIDGATUWY

E

R

O

I D

P

G A

S

F

T U

Q

W Y



ERSOPFQIDGATUWY

E

R

O

I D

P

G A

S

F

T U

Q

W Y



SREOPFQIDGATUWY

S

R

O

I D

P

G A

E

F

T U

Q

W Y



SRQOPFEIDGATUWY

S

R

O

I D

P

G A

Q

F

T U

E

W Y



[A]RQOPFEIDGSTUWY

A

R

O

I D

P

G S

Q

F

T U

E

W Y



ARQOPFEIDGSTUWY

A

R

O

I D

P

G S

Q

F

T U

E

W Y



RAQOPFEIDGSTUWY

R

A

O

I D

P

G S

Q

F

T U

E

W Y



RPQOAFEIDGSTUWY

R

P

O

I D

A

G S

Q

F

T U

E

W Y



RPQOGFEIDASTUWY

R

P

O

I D

G

A S

Q

F

T U

E

W Y



[A]PQOGFEIDRSTUWY

A

P

O

I D

G

R S

Q

F

T U

E

W Y



APQOGFEIDRSTUWY

A

P

O

I D

G

R S

Q

F

T U

E

W Y



QPAOGFEIDRSTUWY

Q

P

O

I D

G

R S

A

F

T U

E

W Y



QPFOGAEIDRSTUWY

Q

P

O

I D

G

R S

F

A

T U

E

W Y



[D]PFOGAEIQRSTUWY

D

P

O

I Q

G

R S

F

A

T U

E

W Y



DPFOGAEIQRSTUWY

D

P

O

I Q

G

R S

F

A

T U

E

W Y



PDFOGAEIQRSTUWY

P

D

O

I Q

G

R S

F

A

T U

E

W Y



POFDGAEIQRSTUWY

P

O

D

I Q

G

R S

F

A

T U

E

W Y



POFIGAEDQRSTUWY

P

O

I

D Q

G

R S

F

A

T U

E

W Y



[D]OFIGAEPQRSTUWY

D

O

I

P Q

G

R S

F

A

T U

E

W Y



DOFIGAEPQRSTUWY

D

O

I

P Q

G

R S

F

A

T U

E

W Y



ODFIGAEPQRSTUWY

O

D

I

P Q

G

R S

F

A

T U

E

W Y



OIFDGAEPQRSTUWY

O

I

D

P Q

G

R S

F

A

T U

E

W Y



[E]IFDGAOPQRSTUWY

E

I

D

P Q

G

R S

F

A

T U

O

W Y



EIFDGAOPQRSTUWY

E

I

D

P Q

G

R S

F

A

T U

O

W Y



IEFDGAOPQRSTUWY

I

E

D

P Q

G

R S

F

A

T U

O

W Y



IGFDEAOPQRSTUWY

I

G

D

P Q

E

R S

F

A

T U

O

W Y



[A]GFDEIOPQRSTUWY

A

G

D

P Q

E

R S

F

I

T U

O

W Y



AGFDEIOPQRSTUWY

A

G

D

P Q

E

R S

F

I

T U

O

W Y



GAFDEIOPQRSTUWY

G

A

D

P Q

E

R S

F

I

T U

O

W Y



GEFDAIOPQRSTUWY

G

E

D

P Q

A

R S

F

I

T U

O

W Y



[A]EFDGIOPQRSTUWY

A

E

D

P Q

G

R S

F

I

T U

O

W Y



AEFDGIOPQRSTUWY

A

E

D

P Q

G

R S

F

I

T U

O

W Y



FEADGIOPQRSTUWY

F

E

D

P Q

G

R S

A

I

T U

O

W Y


Removal of elements from the heapWe have the 3rd element!

[D]EAFGIOPQRSTUWY

D

E

F

P Q

G

R S

A

I

T U

O

W Y



DEAFGIOPQRSTUWY

D

E

F

P Q

G

R S

A

I

T U

O

W Y



EDAFGIOPQRSTUWY

E

D

F

P Q

G

R S

A

I

T U

O

W Y


Removal of elements from the heapWe have the 2nd element!

[A]DEFGIOPQRSTUWY

A

D

F

P Q

G

R S

E

I

T U

O

W Y



ADEFGIOPQRSTUWY

A

D

F

P Q

G

R S

E

I

T U

O

W Y



DAEFGIOPQRSTUWY

D

A

F

P Q

G

R S

E

I

T U

O

W Y


Removal of elements from the heapWe have the 1st element!

[A]DEFGIOPQRSTUWY

A

D

F

P Q

G

R S

E

I

T U

O

W Y


Removal of elements from the heapWe have the 1st element!

ADEFGIOPQRSTUWY

A

D

F

P Q

G

R S

E

I

T U

O

W Y


We are done!

What we get in the end is sorted:

ADEFGIOPQRSTUWY


Heapsort example - University of Cambridge...heapify(6) QWERTY[U]IOPASDFG Q W R I O T P A E Y S D U...

Documents

Transcript of Heapsort example - University of Cambridge...heapify(6) QWERTY[U]IOPASDFG Q W R I O T P A E Y S D U...