What is asymptotically more difficult - linear or squared logarithm?

U

U

uvelichitel2021-03-17 02:17:21

Mathematics

uvelichitel, 2021-03-17 02:17:21

What is asymptotically more difficult - linear or squared logarithm?

O(n) or O((log n)**2), which is more?

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)

S

shurshur, 2021-03-17
@uvelichitel

We open Wolfram Alpha, enter n or (log n)^2 or even n/(log n)^2 and we immediately get the answer: linear is more difficult.

Similar questions

A

Anton2015-11-19 15:20:43

Wolfram Alpha can't numerically integrate functions given in a table? 1Reply

F

FreddieNeptun2015-11-22 21:27:05

Petri nets, is such a transition allowed? 1Reply

M

Mr. Mik2015-11-25 16:11:09

Do I understand the essence of this condition correctly? 1Reply

B

Bogdan Khvalko2020-05-18 17:57:05

Find the points of the circle? 2Reply

K

Keyten2012-07-03 14:45:20

How much will 0/0 be? 10Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question