Prime Number Printing Function | Dataford Interview Questions

Write a function that prints out prime numbers.

Implement print_primes(n), where n is a non-negative integer. The function should identify every prime number from 2 through n, inclusive. For testability, return the primes as a list in ascending order rather than relying only on console output.

Input and Output

Input: integer n
Output: list containing every prime number in the inclusive range [2, n]

A prime number is an integer greater than 1 with exactly two positive divisors.

Constraints

0 <= n <= 10^5
Return primes in ascending order
The range is inclusive of n

Function Signature

def print_primes(n):

Your question is Prime Number Printing Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem