How to write a function (count) to perform the following task. Generate a counter (let's say 20,000) using the function. The function should have one integer argument (in this example, 20,000). Calculate the execution time of code by using the time command and redirect the output to the counter_fun.txt file. Append the counter in an already created text file (counter_fun.txt). How to write a function that uses recursion to generate the same counter and that performs the following tasks. Use the same function (count), but will repeatedly call the same function (recursion) to generate the counter. Calculate the execution time of code by using the time command and redirect the output to the counter_rec.txt file. Append the counter in an already created text file (counter_rec.txt). If we compare both the time, which code (function or recursion) runs efficiently and why.
How to write a function (count) to perform the following task. Generate a counter (let's say 20,000) using the function. The function should have one integer argument (in this example, 20,000). Calculate the execution time of code by using the time command and redirect the output to the counter_fun.txt file. Append the counter in an already created text file (counter_fun.txt). How to write a function that uses recursion to generate the same counter and that performs the following tasks. Use the same function (count), but will repeatedly call the same function (recursion) to generate the counter. Calculate the execution time of code by using the time command and redirect the output to the counter_rec.txt file. Append the counter in an already created text file (counter_rec.txt). If we compare both the time, which code (function or recursion) runs efficiently and why.
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
How to write a function (count) to perform the following task.
- Generate a counter (let's say 20,000) using the function. The function should have one integer argument (in this example, 20,000).
- Calculate the execution time of code by using the time command and redirect the output to the counter_fun.txt file.
- Append the counter in an already created text file (counter_fun.txt).
How to write a function that uses recursion to generate the same counter and that performs the following tasks.
- Use the same function (count), but will repeatedly call the same function (recursion) to generate the counter.
- Calculate the execution time of code by using the time command and redirect the output to the counter_rec.txt file.
- Append the counter in an already created text file (counter_rec.txt).
If we compare both the time, which code (function or recursion) runs efficiently and why.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 6 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