Serialization woes

Robert Jacques sandford at jhu.edu
Fri Apr 20 05:57:19 PDT 2012


On Thu, 19 Apr 2012 13:43:44 -0500, Jacob Carlborg <doob at me.com> wrote:

> On 2012-04-19 15:06, Robert Jacques wrote:
>
>> O(N^2) vs O(N logN) is a performance issue :)
>
> I don't have any memory of you mentioning that back then :)
>

:) I probably didn't. Its one of those things that I consider fairly implicit. (Granted, there are times when big-O complexity has to take back seat to little-O performance, but you normally have to prove them with graphs and use cases)


More information about the Digitalmars-d mailing list