When can an algorithm have square root(n) time complexity?

Question

Can someone give me example of an algorithm that has square root(n) time complexity. What does square root time complexity even mean?

Answer 1

This link provides a very basic beginner understanding of O() i.e., O(sqrt n) time complexity. It is the last example in the video, but I would suggest that you watch the whole video.

https://www.youtube.com/watch?v=9TlHvipP5yA&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=6

The simplest example of an O() i.e., O(sqrt n) time complexity algorithm in the video is:

p = 0;

for(i = 1; p <= n; i++)
{
    p = p + i;
}

Mr. Abdul Bari is reknowned for his simple explanations of data structures and algorithms.