Categories

JavaScriptPHPHTMLCssPythonWordPressWeb developmentLinuxMySQLAndroidWindowsJavaC++ / C#LayoutReactUbuntuYiiDjangoProgramming1C-BitrixLaravelSystem administrationTelegramJSONDebianPostgreSQLIOSGoogleHtaccessWindows ServerGitMacOSGoogle ChromeCMSWooСommerceBootstrapNginxSQLUnityAPI
Make a leaderReport
X
X
xSkyFoXx2016-01-01 17:11:14
Algorithms
xSkyFoXx, 2016-01-01 17:11:14

Which function grows the fastest?

Which function grows faster?: n^log(n) or n^2.
Those. in big O notation, in what order should these functions be placed in ascending order?

Reply
Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)
Similar questions
E
e1s2015-05-26 11:24:41
How to get rid of ban (number of questions) on stackoverflow.com? 2Reply
D
DvaValeta2013-12-02 18:04:54
What to read on the theory of algorithms? 5Reply
T
TreShk02018-08-01 11:07:51
Algorithm for finding the sine of any angle? 6Reply
N
noize2013-12-08 16:02:43
In what courses can you improve the algorithmic base for programming? 2Reply
A
Apathy6662021-10-22 14:09:29
Singly linked lists. Removing an element? 2Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question