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.
Control structures
Control structures are block of statements that analyze the value of variables and determine the flow of execution based on those values. When a program is running, the CPU executes the code line by line. After sometime, the program reaches the point where it has to make a decision on whether it has to go to another part of the code or repeat execution of certain part of the code. These results affect the flow of the program's code and these are called control structures.
Switch Statement
The switch statement is a key feature that is used by the programmers a lot in the world of programming and coding, as well as in information technology in general. The switch statement is a selection control mechanism that allows the variable value to change the order of the individual statements in the software execution via search.
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.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8bb68d7e-0dda-4f44-bcde-638a355d6dc4%2F39955339-6fe9-40e8-9fe7-eace2ed8a077%2Febsp1pp_processed.jpeg&w=3840&q=75)
![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.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8bb68d7e-0dda-4f44-bcde-638a355d6dc4%2F39955339-6fe9-40e8-9fe7-eace2ed8a077%2F5eqnnjk_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 6 steps with 36 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)