projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
0d7b3e7
)
edits
author
Chris Barker
<barker@omega.(none)>
Sun, 19 Dec 2010 16:28:42 +0000
(11:28 -0500)
committer
Chris Barker
<barker@omega.(none)>
Sun, 19 Dec 2010 16:28:42 +0000
(11:28 -0500)
assignment10.mdwn
patch
|
blob
|
history
diff --git
a/assignment10.mdwn
b/assignment10.mdwn
index
1a17b13
..
77449d5
100644
(file)
--- a/
assignment10.mdwn
+++ b/
assignment10.mdwn
@@
-28,8
+28,9
@@
Of course, if you need help or want us to review your efforts, we'll be glad to
As Ken Shan points out, this is an instance of the algorithm
for converting name/year citations (like 'see Montague 1970')
As Ken Shan points out, this is an instance of the algorithm
for converting name/year citations (like 'see Montague 1970')
- to numerals corresponding to their ('see [24]'). Except that
- bibliograpic numerals don't start with zero.
+ to numerals corresponding to their position in the
+ bibliography ('see [24]'). Except that bibliograpic numerals
+ don't start with zero.
Give some thought to efficiency: there are straightforward
solutions that involve traversing the tree once (in order to,
Give some thought to efficiency: there are straightforward
solutions that involve traversing the tree once (in order to,
@@
-42,8
+43,9
@@
Of course, if you need help or want us to review your efforts, we'll be glad to
its number of occurrences in the tree. Is there any way to do
that with a single traversal?
its number of occurrences in the tree. Is there any way to do
that with a single traversal?
- You can assume that the tree is leaf-labeled (no labels on the
- internal nodes), and that the leafs are, say, chars.
+ You can assume that the tree is binary, leaf-labeled (no
+ labels on the internal nodes), and that the leafs are, say,
+ chars.
Here is [a hint](/hints/assignment_10_hint).
Here is [a hint](/hints/assignment_10_hint).