Update notes to include 2.64
This commit is contained in:
parent
688f267874
commit
7049dafa50
14
notes.txt
14
notes.txt
|
@ -84,3 +84,17 @@ x'^2 = x' + 1
|
|||
x'^2 - x' - 1 = 0
|
||||
|
||||
Solutions: (1 +- sqrt(1 + 4)) / 2. So phi is one of the fixed points.
|
||||
|
||||
|
||||
2.64
|
||||
|
||||
partial-tree parititions the list into a left tree, the node, and a right tree. This
|
||||
is done such that the node is of size 1 and the left and right are equal for an odd-sized
|
||||
list and left is 1 smaller than right for an even sized list. partial-tree is then called
|
||||
on the left and right sub trees. The base case for the recursion is when the left and right
|
||||
trees are both of size 0. In this case, partial tree returns a leaf node (i.e. with null
|
||||
left and right pointers).
|
||||
|
||||
Each element of the list is visited once, and for each visit, make-tree is called (which is
|
||||
just a call to list, which is assumed to be O(1)). So list->tree is O(n).
|
||||
|
||||
|
|
Loading…
Reference in New Issue