I've being studying some topics of Discrete Mathematics, and I found only a few examples of problems with uncommon asymptotic costs, like (sqrt(n)) or (log(n)) beyond the obvious ones (binary search, for example).In daily programming, it's common to find linear problems to solve. Doing something to every element of a list, for example.I can't think in any problems like these that costs sqrt(n) or more examples of (log(n)). Also, I never saw an algorithm with (log(log(n))) time complexity. Can you give me some examples?Thanks in advance.
Examples of uncommon problems with different asymptotic costs?
ds.algorithms;time complexity