We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O(n(1+lg alpha))subset of O(nlgn), where the alternation alpha is an element of[1..n-1] approximates the minimal ...