MCPcopy Create free account
hub / github.com/byhieg/JavaTutorial / sink

Method sink

src/main/java/cn/byhieg/algorithmtutorial/Sort.java:302–316  ·  view source on GitHub ↗

从i节点由上到下开始调整,i节点的子节点为2 i + 1, 2 i + 2 i节点要向下移动,直到满足i节点小于两个子节点 @param nums nums[] 数组 @param i i节点

(int [] nums, int i,int n)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

heapSortMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected