Information about the estimation of the complexity of the algorithm

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)

N

Nurzhan Bakibaev, 2011-10-13
@Hypuk

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

Similar questions

A

ArhangelBlack2017-08-14 09:22:52

CMS with visual site structure editor? 5Reply

J

jazzus2019-07-22 18:46:39

How to determine file type? 1Reply

L

Lici2015-02-21 15:06:42

How to create an app in Xcode? 1Reply

V

Vazi2015-02-23 14:15:32

What programming language is suitable for this application? 4Reply

G

Gleb Batishchev2015-02-23 20:16:39

How to make a simple php handler for a feedback form with two fields? 2Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question