Categories

JavaScriptPHPHTMLCssPythonWordPressWeb developmentLinuxMySQLAndroidWindowsJavaC++ / C#LayoutReactUbuntuYiiDjangoProgramming1C-BitrixLaravelSystem administrationTelegramJSONDebianPostgreSQLIOSGoogleHtaccessWindows ServerGitMacOSGoogle ChromeCMSWooСommerceBootstrapNginxSQLUnityAPI
Make a leaderReport
X
X
XBR2011-10-13 14:40:12
Programming
XBR, 2011-10-13 14:40:12

Information about the estimation of the complexity of the algorithm

Dear community, please tell me the literature that will help you deal with all O(n^2) O(log n) in relation to algorithms. How to evaluate, how to approach this issue.

Reply
Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)
Report
N
Nurzhan Bakibaev, 2011-10-13
@Hypuk

3rd and 4th chapter in Cormen: Introduction to Algorithms .

Similar questions
A
ahmed_al_asad2016-08-21 14:32:43
Where can I find video tutorials for django 1.10? 3Reply
M
Max Khrichtchatyi2016-09-06 18:32:50
Why does Android Google Maps show "Refresh" instead of a map? 3Reply
N
nikoyar2014-08-29 22:14:06
How to write to xml file? 4Reply
A
Azami2019-02-11 19:13:50
Should I change host in robots after moving from http to https? 3Reply
A
Alexander Rublev2016-08-10 17:51:25
Is it bad to use one global constant? 2Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question