User talk:DanDan02468

If an algorithm's time complexity is O{[n^(1/2)]!},it is a polynomial-time algorithm or not?
I want to ask a question. If there is an algorithm,its time complexity is O{[n^(1/2)]!},this algorithm is a polynomial algorithm or not?
 * Yes, that is polynomial complexity.-- Eostrix  (&#x1F989; hoot hoot&#x1F989;) 12:44, 11 February 2021 (UTC)

Now,I want to ask second question. If an algorithm's time complexity is O{n^[(1/2)n^(1/4)]},it is a polynomial algorithm or not?You'd better tell me why.