What is "time complexity O ( n l g n ) {\displaystyle
| This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
| ||||||||||||||||||
What is "time complexity ?" Is it ? Kkddkkdd (talk) 15:29, 22 April 2015 (UTC)
Qeustion(1) wrt. above: why should there be an interpreation-difference wrt. "lg(..)" vs "log(..)", ie, as both are used (among others in Copmtuer-science) to abbreviate the "logarithm(..)" term? (oekseth)
Qeustion(2): First impression is that is used, ie, simliar to typical kd-tree implementastiions: anyone who have read library-soruce-codes validating latter assumption? — Preceding unsigned comment added by 82.164.65.143 (talk) 22:54, 17 May 2017 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.