17 lines
877 B
Text
17 lines
877 B
Text
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:43:4-43:10: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:102:4-102:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:102:4-102:13: warning: declaration uses 'sorry'
|
||
Array.heapSort.loop._eq_1.{u_1} {α : Type u_1} (lt : α → α → Bool) (a : BinaryHeap α fun y x => lt x y)
|
||
(out : Array α) :
|
||
Array.heapSort.loop lt a out =
|
||
match e : BinaryHeap.max a with
|
||
| none => out
|
||
| some x =>
|
||
let_fun this := ⋯;
|
||
Array.heapSort.loop lt (BinaryHeap.popMax a) (Array.push out x)
|