Cattle primary passenger screening algorithm fourth note 2

Explain in five minutes

Dutch flag 10 minutes here defines two regions is greater than the region area is smaller than

30 minutes

The following figure is given a number to the last digit in general we as num (this will be followed by a few other random number and rows of fast random exchange so called fast random row)

This number is less than equal to put the left to the right place to put greater than the intermediate

Add this line to represent a random row fast swap represents a random location

Fast random row is the most common sort

55 minutes

Note Recursive behavior is not allowed on any project recursive loop behavior can become our own pressure that do not break the system to help us push

How into non-recursive?

1:16 begin to pile row

Heap structure is a complete binary tree complete binary tree is either a full binary tree (any non-leaf nodes of the child must be a full binary tree that is full of the bottom layer are leaf nodes)

From left to right or complete binary tree is a tree filled

In practice heap array can be used to implement an array can be understood as a complete binary tree binary tree is actually fill out our brain

By numerical relationship between the index can be calculated and the relationship between the left and right parent

Two kinds of heap large and small root root heap heap

Large stacks in the star complete binary tree root in any subtree of a maximum value of the head is small stack of any one root subtree is the minimum value for any head is such a subtree

How to convert an array of piles ?? 1:27

The establishment of large root heap

Code 1:35

heapInsert is inserted during the upward than the parent node if large exchanged

heapInsert is the process of establishing large root heap

1:38 When creating large root heap of complexity

When a number of points along the way add to the mix and the number of other related and not related

So a number of highly relevant and would add to the mix

A binary tree nodes is N, then so her height logN, so the establishment of this highly relevant log1 large root heap of complexity and node + log2 + .. logN-1 = NN nodes joined to become the complexity of large root heap is

O (N)

Heapify action is to pop up when the top of the stack and the last top of the stack arr [0] and then exchange the sinking operation heapify

heapify array which is when a value becomes small example here is smaller sank how to reconvert into large root heap explain when 1:45

这里由6->1