Company: Natwest_29aug
Difficulty: medium
Prime Numbers Problem Description A prime number is divisible only by 1 and itself. You will be given a positive integer num . Your task is to write an algorithm to find all the prime numbers from 2 up to the given positive number. Input: The first line of the input consists of an integer num , representing the number written on the board. Output: Print space-separated integers representing the prime numbers requested in increasing order. If no prime number exists within the given range, then do not print anything. Examples Example 1: Input: 11 Output: 2 3 5 7 11 Explanation: The prime numbers less than or equal to 11 are 2, 3, 5, 7, and 11. Constraints 1