hello all,

can someone help me in calculating the time complexities of the following algorithms:

1) for i ← 1 to n^2

for j ← i to i^3

k ← k + 1

2) i ← n

while i > 0

for j ← 1 to i^2

x ← (x + j)/2

i ← ⌊i/2⌋

the trouble I am facing in the above algos while calculating time complexity is that i am unable to relate the inner loop running time with respect to n.

Please reply asap.

Thanks & Regards