computer science - Good text on order analysis -
as self-taught computer programmer, i'm @ loss estimate o() value particular operation. yeah, know off top of head of important ones, major sorts , searches, don't know how calculate 1 when new comes along, unless it's blindingly obvious. there web site or text explains how that? heck, don't know computer scientists call it, can't google it.
if want learn topic, need standard theory/algorithms textbook. don't know of website can teach complexity analysis ("complexity" or "time complexity" how call o() values; might want google "analysis of algorithms" or "introduction algorithms" or such).
but before -- free option. there slides course given erik demaine , charles leiserson in mit, free , great. try read them , see if works you. here.
now, textbooks:
the classical choice textbook cormen et al's book introduction algorithms (there might cheap version available buy here , remember seeing free (possibly illegal) version online, don't remember where).
a more recent , modern-style book, imo more fun read , better choice, kleinberg , tardos' algorithm design.
here websites information (i got these googling "algorithm analysis lecture notes" without quotes):
the above written computer science theorist. programmers or other practical people might have different opinions.
Comments
Post a Comment