This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (a) Show that X 62 can be computed with only eight multiplications. (b) Write the fast exponentiation routine without recursion in Java. Submit your solution on paper, and be ready to explain it during tutorials. You may try to implement the algorithm in Java (optional). (c) Give a precise count on the number of multipications used by the fast exponentiation routine in the textbook. (Hint: Consider the binary representation of N .) 1...
View
Full
Document
This note was uploaded on 06/09/2011 for the course CS 11025 taught by Professor Nil during the Spring '11 term at National University of Singapore.
 Spring '11
 NIL
 Algorithms, Data Structures

Click to edit the document details