Categories

JavaScriptPHPHTMLCssPythonWordPressWeb developmentLinuxMySQLAndroidWindowsJavaC++ / C#LayoutReactUbuntuYiiDjangoProgramming1C-BitrixLaravelSystem administrationTelegramJSONDebianPostgreSQLIOSGoogleHtaccessWindows ServerGitMacOSGoogle ChromeCMSWooСommerceBootstrapNginxSQLUnityAPI
Make a leaderReport
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)
Report
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
AndrewParking2018-05-17 20:08:11
Is it possible to study mathematics for ML using books from the series "Mathematics at a technical university"? 1Reply
D
dom1n1k2018-05-23 10:52:16
What is the best way to store a Voronoi diagram? 2Reply
Y
Yuri2013-02-18 10:39:22
Calculator that supports SI prefixes (under Linux)? 1Reply
M
MaxSurm2016-01-14 23:08:51
How does the diagonal Sobel filter work? 1Reply
N
Nikolaanastasiia2020-06-13 21:21:52
How to do decryption? First there was a series of letters, the encoded word was deciphered, but how to do it back? 1Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question