Consider the Peasants' Algorithm for multiplication of two positive integers. It works in the following manner: ● Write the two numbers in two columns. Keep updating according to the following procedure until the number in the first (i.e., left) column becomes 1. ● Halve the number in the first column (integer division), double the number in the second column. ● In the end, sum up all the numbers in the second column, for which, the corresponding number in the first column is odd. Example of multiplication using Peasants’ algorithm: 13 x 8: 13 8 ← 6 16 3 32 ← 1 64 ← Answer: 64 + 32 + 8 = 104 Write a c++ program function to calculate multiplication using the Peasants’ algorithm. Can you try the recursive function for the same?
Consider the Peasants' Algorithm for multiplication of two positive integers. It works in the following manner: ● Write the two numbers in two columns. Keep updating according to the following procedure until the number in the first (i.e., left) column becomes 1. ● Halve the number in the first column (integer division), double the number in the second column. ● In the end, sum up all the numbers in the second column, for which, the corresponding number in the first column is odd. Example of multiplication using Peasants’ algorithm: 13 x 8: 13 8 ← 6 16 3 32 ← 1 64 ← Answer: 64 + 32 + 8 = 104 Write a c++ program function to calculate multiplication using the Peasants’ algorithm. Can you try the recursive function for the same?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Consider the Peasants'
manner:
● Write the two numbers in two columns. Keep updating according to the following procedure until the
number in the first (i.e., left) column becomes 1.
● Halve the number in the first column (integer division), double the number in the second column.
● In the end, sum up all the numbers in the second column, for which, the corresponding number in the
first column is odd.
Example of multiplication using Peasants’ algorithm: 13 x 8:
13 8 ←
6 16
3 32 ←
1 64 ←
Answer: 64 + 32 + 8 = 104
Write a c++ program function to calculate multiplication using the Peasants’ algorithm. Can you try the recursive
function for the same?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education