Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have a digit 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 21PE
icon
Related questions
icon
Concept explainers
Question

Please help me with this question. I am having a hard time understanding what to do. Please complete the question in the image below. Include post and preconditions

Thank you 

Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are
smaller than n and have a digit 5. For example, if nis 100, the program should output 5,53 and 59.
Your solution should have a main algorithm and two sub-algorithms, let's call them
prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15.
You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Transcribed Image Text:Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have a digit 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are
smaller than n and have a digit 5. For example, if nis 100, the program should output 5,53 and 59.
Your solution should have a main algorithm and two sub-algorithms, let's call them
prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15.
You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Transcribed Image Text:Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have a digit 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Expert Solution
steps

Step by step

Solved in 6 steps with 36 images

Blurred answer
Knowledge Booster
Control Structure
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr