Printing all Divisor of X in O(sqrt(n)*log(n)) time in increasing order

Hi Guys, this is a part of the Number Theory Course and in this video, I discuss about finding all divisor of a natural number in sqrt(n) time complexity. Currently, I have just made 1 video so I am publishing this and as soon as I make more I will upload and share here.

L01: Divisibility Test
E001: Treasure Hunt ( Codechef )
L03: Printing all Divisor of X in sort(n) in increasing order

Your suggestion/ support is needed to grow this channel ( #codeforcode ) and help us all together.

Problem Discussion

Thank You for your valuable time.
CODELABS3277 ( https://www.codelabs3277.org )

2 Likes

Hmm…the complexity is O(sqrt(n)*log(n)) since you are inserting elements in a set. But if we want to print divisors in arbitrary order then it is O(sqrt(n)).
Btw, nice video…good for beginners

1 Like

@samarth2017 thank you for correcting me.

(post withdrawn by author, will be automatically deleted in 24 hours unless flagged)

(post withdrawn by author, will be automatically deleted in 24 hours unless flagged)

Don’t yout feel that you have copied codeNcode Too much

@engineerman thank you for notifying me.