python program to find all prime numbers within a given range

#not made by me but a person name "Concerned Cod" i put only input in it so it makes easy to copy-paste LOL
start = int(input("enter start range : "))
end = int(input("end range : "))
 
for i in range(start,end):
  if i>1:
    for j in range(2,i):
        if(i % j==0):
            break
    else:
        print(i)

Here is what the above code is Doing:
1. It takes the start and end range from the user.
2. It iterates over the range.
3. It checks if the number is greater than 1.
4. If the number is greater than 1, it checks if the number is divisible by any number between 2 and itself.
5. If the number is divisible by any number between 2 and itself, it is not a prime number.
6. If the number is not divisible by any number between 2 and itself, it is a prime number.
7. It prints the prime numbers.