|
|
|
|
|
Jérémy Barbay
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within ??(??(1+lg??))???(??lg??)
O
(
n
(
1
+
lg
a
)
)
?
O
(
n
lg
n
)
, where the alternation ???[1..??-1]
a
?
[
1
.
.
n
-
1
]
approximates the minimal...
ver más
|
|
|
|
|