Finds the prime numbers faster by checking divisions by prime numbers only

FastPrime.py

#This algorithm will find the prime numbers
#faster than conventional methods
#by checking only the prime number divisiblity
prime = [2]
for i in range(2, int(input())):
    l = int(i ** 0.5) + 1
    for j in prime:
        if j > l:
            prime.append(i)
            break
        elif i % j == 0:
            break
    else:
        prime.append(i)
print(prime)