000 02254nmm a2200361Ia 4500
001 00007254
003 WSP
005 20220711214104.0
007 cr |uu|||uu|||
008 181219s2009 si a ob 001 0 eng c
010 _z 2010278418
040 _aWSPC
_beng
_cWSPC
020 _a9789814271424
_q(ebook)
020 _z9789814271400
_q(hbk.)
050 0 4 _aQA9.58
_b.S63 2009
072 7 _aCOM
_x014000
_2bisacsh
072 7 _aMAT
_x008000
_2bisacsh
072 7 _aMAT
_x036000
_2bisacsh
082 0 4 _a518/.1
_223
100 1 _aSoltys, Michael,
_d1971-
_93478
245 1 3 _aAn introduction to the analysis of algorithms
_h[electronic resource] /
_cMichael Soltys.
260 _aSingapore :
_bWorld Scientific Publishing Co. Pte Ltd.,
_c©2009.
300 _a1 online resource (152 p.) :
_bill.
538 _aSystem requirements: Adobe Acrobat Reader.
538 _aMode of access: World Wide Web.
588 _aTitle from web page (viewed December 20, 2018).
504 _aIncludes bibliographical references (p. 129-130) and index
520 _a"This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants. The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions. This self-contained book is intended for undergraduate students in computer science and mathematics."--
_cPublisher's website.
650 0 _aAlgorithms
_vTextbooks.
_93479
650 0 _aElectronic books.
_920567
856 4 0 _uhttps://www.worldscientific.com/worldscibooks/10.1142/7254#t=toc
_zAccess to full text is restricted to subscribers.
942 _cEBK
999 _c72446
_d72446