a的n次方的快速算法（A fast algorithm for the n power of a）.doc

a的n次方的快速算法（A fast algorithm for the n power of a） EN binary power The power of n a for solving this problem, many people see after all do not think what content! The first time I think this problem would not have what content, but then think carefully, there really is a learning oh! See if we find A8, there are two kinds of methods 1.a8 = a * a * a * a * a * a * a * a need to compute 7 multiplication 2.a = 8 (a * a * A * A) (where A = a * a) need to compute 3 multiplication An algorithm for such a simple calculation step difference is a big difference, so for a common n representation The general method of solving? After many days of thinking, no results, today suddenly in a book to see about this algorithm, exultation. The solution to tidy up a bit, and then gives the specific code. The idea of the algorithm General for a (2x + b) = a2x * a B So there is (b = 0): a = 2x + B (AX) 2; (b = 1): a = 2x + B (a x) 2 * a; For an, the first N binary representation to write, so An = a (N1 N2 N3 N4 (2) =..)... Then we can from left to right as shown in the following table (when n = 13, 1101) N bit One One Zero One Multiplicative A A2 * a = A3 (A3) A6 = 2 (A6) 2 * a = A13 The first code (using Java, with the function call, failure effect) Package alg; Public class {AN Public static final int EXIT = 3; Int a; / / base Int bin; / / index Public StackInteger s; Public AN (int a, int bin) { This.a = a; This.bin = bin; S = new (StackInteger); S.push (EXIT); / / as a sign of the last ToBin (bin); } Public void renew (int a, int bin) { This.a = a; This.bin = bin; S.push (EXIT); / / as a sign of the last ToBin (bin); } / / is from left to right Public int (leftToRight) { Int i; Int result = 1; While (true) { (I = s.pop); Switch (I) { Case 0: Result = result; Break; Case 1: Result = result * result * a; Break; Case EXIT: Return result; } } } Public int rightToLeft (int a) { Return 0; } / * * * the decimal into binary stack * * @param ten * / Public StackInteger toBin (int ten) { Int te