Write a program to find greatest prime number in an given range

Question

Language is either java or python

Answer 1

Hint: a prime number is only divisible by one and itself, there is no shortcut to avoid checking every division possible.

Answer 2

If range is from [a,b] (b>a), then start going from b to a, when find prime then break; from loop as it will be the largest prime in that range