Changes between Initial Version and Version 1 of Ticket #4398, comment 27


Ignore:
Timestamp:
2017-10-26T17:08:10Z (7 years ago)
Author:
Francesco Casella

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #4398, comment 27

    initial v1  
    66> And it would be `O(N*K*(log(N)+log(K)))` for a binary tree;
    77
    8 No matter how large K is, O(N*K*(log(N)+log(K))) is always better than O(N^2) for sufficiently large N.
     8No matter how large K is, O(N*K*(log(N)+log(K))) is always better than O(N^2^) for sufficiently large N.