大久保弘崇
Errata-7
最終更新：
hirotakaohkubo
-
view
Chapter 13
At first I propose a function sortPerm,
which computes the permutation that sorts given list.
which computes the permutation that sorts given list.
This function increses modularity and makes unstable sort stable.
p.92 l.-2
should be
p.99 l.-10
Wrong: 
Correct:
Correct:
p.100 l.13
Wrong: 
Corrent:
Corrent:
p.100
Discussion here about rots and tails . tag is incorrect.
Whichever EOF is larger or smaller, equation
Whichever EOF is larger or smaller, equation
cannot establish.
Counterexample:
Compute
and ![\textit{sortPerm } ( \textit{take } 5 \; (\textit{tails }(\textit{xs} +\!\!+ [\textit{EOF}])) )](http://chart.apis.google.com/chart?cht=tx&chf=bg,s,ffffff00&chco=000000ff&chs=25&chl=%5Ctextit%7BsortPerm%20%7D%20%28%20%5Ctextit%7Btake%20%7D%205%20%5C%3B%20%28%5Ctextit%7Btails%20%7D%28%5Ctextit%7Bxs%7D%20%2B%5C%21%5C%21%2B%20%5B%5Ctextit%7BEOF%7D%5D%29%29%20%29)
Compute
| xs | rots | EOF=0 | EOF=3 |
| [1,2,2,2,2] | [0,4,3,2,1] | [0,4,3,2,1] | [0,1,2,3,4] |
| [2,1,1,1,1] | [1,2,3,4,0] | [4,3,2,1,0] | [1,2,3,4,0] |
p.101 l.4, l.5 def of transform
Wrong: ![[0\cdot\cdot{}n-1]](http://chart.apis.google.com/chart?cht=tx&chf=bg,s,ffffff00&chco=000000ff&chs=25&chl=%5B0%5Ccdot%5Ccdot%7B%7Dn-1%5D)
Correct:![[0 .. n-1]](http://chart.apis.google.com/chart?cht=tx&chf=bg,s,ffffff00&chco=000000ff&chs=25&chl=%5B0%20..%20n-1%5D)
Correct:
Wrong: n = length ys
Correct: n = length xs
Correct: n = length xs
My proposal
The definition of apply(p.97 l.9), it is sufficient
So, in the final version of transform (p.101)
and array pa not needed, but to compute ps, we cannot use "Ranking suffixes"
