Question

What would be an example of an O(sqrt(log(n))) algorithm. A question on my test asked what could NOT be a complexity of insert on a priority queue. I knew that this could not be it (because insert in a priority queue can only be done in O(1), O(N), or O(log(N), depending on implementation), but I was wondering what type of algorithm would have O(sqrt(log(n))) complexity. What would be an example of an O(sqrt(log(n))) algorithm. A question on my test asked what could NOT be a complexity of insert on a priority queue. I knew that this could not be it (because insert in a priority queue can only be done in O(1), O(N), or O(log(N), depending on implementation), but I was wondering what type of algorithm would have O(sqrt(log(n))) complexity. @Computer Science