An introduction to the analysis of algorithms /
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 employ...
Πλήρης περιγραφή
Αποθηκεύτηκε σε:
Πρώτος συγγραφέας: |
Soltys, Michael, 1971- |
Μορφή: |
Βιβλίο
|
Γλώσσα: |
English
|
Άλλες Λεπτομέρειες Έκδοσης: |
Singapore, SG :,
World Scientific,,
c2010.
|
Θέματα: |
|