MESSAGE
DATE | 2016-11-10 |
FROM | Asia Suarez
|
SUBJECT | Re: [Hangout-NYLXS] mergesort tutorial
|
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.
Sent from my iPhone
> On Nov 9, 2016, at 9:25 PM, Ruben Safir wrote: > >> On 11/09/2016 07:28 AM, Asia Suarez wrote: >> asymptotic runtime of O(log n) > > Why Asia? > > -- > 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/ _______________________________________________ hangout mailing list hangout-at-nylxs.com http://www.nylxs.com/
|
|