- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for binarySearchTree (0.46 sec)
-
src/runtime/mgcstack.go
// If n == 0, returns nil, x. func binarySearchTree(x *stackObjectBuf, idx int, n int) (root *stackObject, restBuf *stackObjectBuf, restIdx int) { if n == 0 { return nil, x, idx } var left, right *stackObject left, x, idx = binarySearchTree(x, idx, n/2) root = &x.obj[idx] idx++ if idx == len(x.obj) { x = x.next idx = 0 } right, x, idx = binarySearchTree(x, idx, n-n/2-1) root.left = left
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 21 21:06:52 UTC 2023 - 10.6K bytes - Viewed (0)