Course page Home page Home page CoursesNew course

Proof, invariants, and correctness: Computer Science course | Zoonk

17. Proof, invariants, and correctness

Reason about whether programs and algorithms are correct using preconditions, postconditions, loop invariants, examples, counterexamples, and small proofs. This chapter trains the habit of proving claims instead of only hoping tests pass.

Computer Science

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc