MESSAGE
DATE | 2016-11-10 |
FROM | Ruben Safir
|
SUBJECT | Re: [Hangout-NYLXS] mergesort tutorial
|
On 11/10/2016 12:16 AM, Asia Suarez wrote: > Agh I take that back. I takes O(n) to merge and O(logn) to sort so the total asymptotic runtime is O(nlogn). I will look more into that +1.
why? This is not a quiz. It is information sharing ;)
Teach me something!
-- So many immigrant groups have swept through our town that Brooklyn, like Atlantis, reaches mythological proportions in the mind of the world - RI Safir 1998 http://www.mrbrklyn.com
DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002 http://www.nylxs.com - Leadership Development in Free Software http://www2.mrbrklyn.com/resources - Unpublished Archive http://www.coinhangout.com - coins! http://www.brooklyn-living.com
Being so tracked is for FARM ANIMALS and and extermination camps, but incompatible with living as a free human being. -RI Safir 2013 _______________________________________________ hangout mailing list hangout-at-nylxs.com http://www.nylxs.com/
|
|