Re: [OFF TOPIC] Algorithms (was: Re: Too fine design granularity leads to numerous macro/function/command existed in Emacs.)

[Emanuel Berg]

Yuri Khan wrote:

> The advice is sound. Asymptotically, sorting in order to
> extract one longest (maximum, best) element is like firing
> a cannon at sparrows: sorting requires O(N*log(N))
> comparisons but a single maximum value can be found in just
> O(N).

-1

-- 
underground experts united
https://dataswamp.org/~incal