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

JS Primality Test

O(sqrt(n))

A slightly more performant version, thanks to Samme Bae, for enlightening me with this.