"retard" <r...@tard.com.invalid> wrote in message news:hunc9t$1c9...@digitalmars.com... > Wed, 09 Jun 2010 01:13:43 -0400, Nick Sabalausky wrote: > >> "retard" <r...@tard.com.invalid> wrote in message >> news:hun6ok$13s...@digitalmars.com... >>> Tue, 08 Jun 2010 16:14:51 -0500, Andrei Alexandrescu wrote: >>> >>>> On 06/08/2010 04:05 PM, Walter Bright wrote: >>>> >>>> max of n elements is O(n). >>> >>> This probably means that D 2 won't be very efficient on multicore until >>> the authors learn some basic parallel programming skills. Now where did >>> you get your PhD - I'm collecting a list of toy universities people >>> should avoid. >> >> You used to have meaningful things to say. Now you're just trolling. > > Max of n unordered elements can be solved in O(log log n) time assuming > you have enough cores and constant time memory access. Happy now?
Yes, actually :)