Finding complexity of algo

See more:

Python

algorithm

Pascal

Hello All,

Thanks for participation and your precious suggestions, I have done some of the algorithms but I stuck in these two, Could you (experts) find time complexity for the following two algorithm with explanation (steps) so I can solve the rest in future.

Note: I am not been paid nor given task but I wan to solve these algorithm posted in shape of paper on pdfcoffee.com

Algorithm which just sums up for no apparent reason

𝑝𝑟𝑜𝑐𝑒𝑑𝑢𝑟𝑒𝑆𝑜𝑚𝑒𝐴𝑙𝑔3(𝑛)
𝑠𝑢𝑚 = 0
𝑓𝑜𝑟 𝑖 = 1 𝑡𝑜 √𝑛 𝑑𝑜
𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖
𝑒𝑛𝑑 𝑓𝑜𝑟
𝑓𝑜𝑟 𝑖 = 1 𝑡𝑜 √𝑛 𝑑𝑜
2
𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖
𝑒𝑛𝑑 𝑓𝑜𝑟
𝑓𝑜𝑟 𝑖 = 1 𝑡𝑜 10 𝑑𝑜
𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖
𝑒𝑛𝑑 𝑓𝑜𝑟
𝑒𝑛𝑑 𝑝𝑟𝑜𝑐𝑒𝑑𝑢𝑟𝑒


Algorithm which just sums up for no apparent reason

𝑝𝑟𝑜𝑐𝑒𝑑𝑢𝑟𝑒𝑆𝑜𝑚𝑒𝐴𝑙𝑔4(𝑛)
𝑠𝑢𝑚 = 0
𝑓𝑜𝑟 𝑖 = 1 𝑡𝑜 √𝑛 𝑑𝑜
𝑓𝑜𝑟 𝑗 = 1 𝑡𝑜 5 𝑑𝑜
𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖 ∗ 𝑗
𝑒𝑛𝑑 𝑓𝑜𝑟
𝑒𝑛𝑑 𝑓𝑜𝑟
𝑒𝑛𝑑 𝑝𝑟𝑜𝑐𝑒𝑑𝑢𝑟𝑒

What I have tried:

I have find complexity for an online paper of algorithm posted at pdfcoffee but the two algorithms, I am stuck to. so need help to solve.