Big O Notation Help

[shafqatu]

Hi guys I am little confused, I want to calculate the Big O notation for my alog, and I am confused. my algo is given below. I will really appreciate it if someone can help me.
I am writing my thesis, and i need big O notation for this. I have not studied complexity theory subject that's why i don't have any idea of how to do it.

if someone could explain this to me, my email address is <<snip>>

thanks

---------------------------------------
f≔Feedback function of the Fibonacci NLFSR
K≔{kx│kx is the bit position from terminal bit to function degree}

P≔{pj│pj are the product terms in the ANF of the function}

L≔{li│li are the literanls of the products pj in ANF of function f}

for each kx Ɛ K do
for each pj Ɛ P do
flag=0
for each li Ɛ L do
calculate the new index for the literal of product
if(new index of literal≥0 && flag!=-1)
flag=1
else
flag=-1
end if
end for

if(flag==1)
push the product pj to vector kx
end if
flag=0
end for
if(size of vector kx≥1)
psuh the vector kx to the List
end if
end for