Integer factorization in python -

i've seen on website many way of doing integer factorizations in python, didn't understand them, tried on own way :

def factorisation(n): fact = [] = 2 while i<=n:          if n%i==0:               fact.append(i)         n//=     else:         i+=1 return fact 

i think working, don't know why while loop n ... lesson learnt have if 2 sqrt(n). did misunderstand ? can improve ? :)

when integer n not divisible number sqrt(n), sufficient indicate n prime. in case won't find additional factors other n itself.

so can stop loop @ sqrt(n), , add remaining value of n list of prime factors.