> Using Big-Og notation, find the worst-case running time?

Using Big-Og notation, find the worst-case running time?

Posted at: 2014-12-18 
1.

for i <- 0 to nlogn do

for j <- 0 to n^2-1 do

let A[i mod n] <- A[i mod n] + j.

end for

end for

2.

s<-- A[0]

for i <-- 1 to n-1 do

s <-- s + A[i]

return s

Not sure how to do these two problems, please explain the steps that were taken thank you.