Good text when analyzing orders

Question

As a self-taught programmer, I often find it difficult to evaluate the value of O () for a particular operation. Yes, I know the most important of them, both for the main varieties and searches, but I do not know how to calculate when something new comes in, unless it is dazzlingly obvious. Is there a good website or text that explains how to do this? Hell, I don’t even know what computer scientists say, so I can’t do it.

Answer 1

If you really want to study this topic, you probably need a standard theory / algorithm tutorial. I don’t know a single website that can teach you how to analyze complexity (“complexity” or “temporary complexity” is what you call these O () values, you might also want google to “analyze the algorithms” or “introduce into algorithms "or such).

But before that - a free option. There are slides from a course provided by Eric Demain and Charles Leyserson at the Massachusetts Institute of Technology, which are free and look great. I would definitely try reading them and see if this works for you. They are here .

Now the tutorials:

The classic textbook choice - Cormen et al. An introduction to algorithms (there may be a cheap version available for purchase here , and I remember that I see a free (possibly illegal) version on the Internet, but I don’t remember where).

A later and modern book, in which IMO is more interested in reading and a better choice, is the Design Algorithm .

Here are a few websites with information (I got them from search queries for analyzing "without quotes" algorithms):

• Algorithms Lecture Notes
• Lecture Notes by Steve Leken

The above is written by a computer science theorist. Therefore, programmers or other practical people may have different opinions.

Answer 2

He called Big O Notation , and it was used in Computational Theory of Complexity .

Wikipedia articles are a pretty good starting point, as well as a bibliography at the bottom of the page.

Answer 3

An introduction to algorithms is the standard text used by most universities. I used it and can recommend these chapters when analyzing orders. I would start with articles in Tim Howland's answer.

Answer 4

It is called the analysis of algorithms and is the science itself. Take a look at some of the books here.

Answer 5

Your links lead me to a site in Russian that seems to want to use a user ID and password. A legitimate mistake, or a troll? Paul Tomblin

The site is in Bulgarian, and you do not need a password to access the list of files with which I am associated and to download some of them. Unless, of course, there is an access restriction for IP addresses from outside of Bulgaria, which I really do not know about.

Sorry, I do not know how to make a comment.