2.105算法.ppt

2.4 Integers and Algorithms INTRODUCTION As mentioned in Section 2.1 , the term algorithm originally referred to procedures for performing arithmetic operations using the decimal representations of integers . These algorithms,adapted for use with binary representations , are the basis for computer arithmetic . The provide good illustrations of the concept of the algorithm and the complexity of algorithms . For these reasons,they will be discussed in this section. These are many important algorithms involving integers besides those used in arithmetic . We will begin our discussion lf integers and algorithms with the Euclidean algorithm . It is one lf the most useful algorithms , and perhaps the oldest algorithm in mathematics .We will also describe an algorithm for finding the base b expansion of a positive integer for any base b. REPRESENTATIONS OF INTEGERS In everyday life we use decimal notation to express integers . For example,965 is used to denote 9·102 +6 ·10+5. However , it is often convenient to use bases other than 10 . In particular ,computers usually use binary notation (with 2 as the base) When carrying out arithmetic, and octal (base 8)or hexadecimal (base 16) notation when expressing characters , such as letters or digits.In fact,we can use any positive integer greater than 1 as the base when expressing integers .This is stated in the following theorem. Theorem 1 Let b be a positive integer greater than 1 . Then if n is a positive integer , it can be expressed uniquely in the form n=akbk+ ak-1bk-1 + · · ·+ a1b +a0, where k is a nonnegative integer, a0, a1,…,ak are nonnegative integers less than b,and ak≠0. Example 2 What is the decimal expansion of the integer that has (101011111)2 as its binary expansion? Solution: We have (101011111)2 =28+26+24+23+22+2+1=351. Sixteen is another base used in computer science.The base 16 expansion of an integer is called its hexadecimal expansion.Sixteen different digits are require