Algorithms
Search this site
Algorithmic Problem Solving
Algorithmic Problem Solving
Introduction
APS Documents
CSE 101
Syllabus
Hours
Evaluation
Resources
CSE 202
Syllabus
Hours
Evaluation
Resources
CSE 190
Syllabus
Evaluation and Hours
CSE 203A
Syllabus
Evaluation and Hours
Documents
Techniques
>
Proving Algorithms Correct
Techniques for Proving the Correctness of Algorithms
Resources
How to prove greedy algorithm is correct
Proving algorithm correctness
How to use induction and loop invariants to prove correctness
How to use strong induction to prove correctness of recursive algorithms
Discrete mathematics textbooks
Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer, Stephenson Jenkyns
Available for free at
http://link.springer.com/book/10.1007%2F978-1-4471-4069-6
from a UCSD internet connection.
Mathematics for Computer Science
by Lehman, Leighton and Meyer