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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
£ 6.44 shipping from U.S.A. to United Kingdom
Destination, rates & speedsFREE shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.95. Seller Inventory # G9814271403I4N00
Quantity: 1 available
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-146130
Quantity: 1 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-293101
Quantity: 1 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 150 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 5170899/2
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 6410634-n
Quantity: 6 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # CW-9789814271400
Quantity: 15 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: Used. pp. xiii + 135 Illus. Seller Inventory # 6432106
Quantity: 1 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. Illustrated. 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 and 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. Seller Inventory # LU-9789814271400
Quantity: 9 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9789814271400_new
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # CW-9789814271400
Quantity: 15 available