hai there, does anyone know what is the time complexity of MP3 encoder
algorithm such as Lame or the Fhg? i mean what is the big O number? is it
O(n), O(n2) or else? could someone tell me how to measure this up? thanx
alot
Encoder complexity is roughly linear related to the number of input
I was recently trying to track down why it was that LAME's --nogap
option implicitly disabled Xing headers. Turning them back on was
obvious, but it reintroduced a gap, which seemed odd, but which was, I
assume, why they were turned off in the first place.
In trying to figure out the cause of
