From: Regis d'Aubarede <lists@...>
Date: 2012-11-29T23:32:26+09:00
Subject: Re: Getting the smallest Items of an Array

> Uhh... how about ary.sort.first(n)?


Of sort complexity id O(n*log(n), i thought that sorting the complete 
array
was less smart then my solution which is should be
O(m*n) / m=number of minus item selected.

but it is not true:
nlog(n) with n=100_000           >> 1_115_000
m*n     with n=100_000 and m=10  >> 1_000_000

perhaps there is a mistake somewhere ?

-- 
Posted via http://www.ruby-forum.com/.