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
N
Nurdaulet Maksutov2021-02-22 20:46:30
Split string by character sequence? 2Reply
K
Konstantin Basarab2017-02-22 15:51:36
Affiliate for the E-mail mailing form - how to do it? 5Reply
M
Magnat122019-07-21 01:31:30
Is there an algorithm for dividing information into several parts, with the ability to restore the original information with only two parts? 2Reply
I
Ilias2017-02-24 00:17:46
How to solve Olympiad problems in programming? 1Reply
C
Chokatillo2017-02-25 17:21:04
How to show the current date of groups of posts when scrolling (while hiding other dates)? 0Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question