CSC165H1 Lecture : CSC165 - Chapter5
29 Oct 2012
School
Department
Course
Professor
3
CSC165H1 Full Course Notes
Verified Note
3 documents
Document Summary
So far we have been proving statements about databases, mathematics and arithmetic, or sequences of numbers. Though these types of statements are common in computer science, you"ll probably encounter algorithms most of the time. Often we want to reason about algorithms and even prove things about them. In this chapter we"ll introduce a number of tools for dealing with computer algorithms, formalizing their expression, and techniques for analyzing properties of algorithms, so that we can prove correctness or prove bounds on the resources that are required. In our everyday life, we write numbers in decimal (base 10) notation (although i heard of one kid who learned to use the ngers of her left hand to count from 0 to 31 in base. In decimal, the sequence of digits 20395 represents (parsing from the right): Each position represents a power of 10, and 10 is called the base.
