hi I'm a computer science student and I'm having a lot of trouble with some of these exercises our professor gave us, it would be wonderful if someone could help me out with these.
1-find the relationship between each complexity pair for their big o, θ, Ω
1-(logn+5), (logn^2)
2-(log^2n),(logn^2)
3- (3^n),(5n^2)
4-(2^n),(nlogn)
5-(3^n),(logn)^2
6-(nlogn+n^2),(logn+10)
7-2^n,n!
2-if an algorithm's time complexity on average-case is θ(f(n)) prove that on the worst-case its Ω(f(n))
and o(f(n)) for best case
Submitted November 22, 2020 at 06:46AM by overlord479 https://ift.tt/396f3U8
No hay comentarios:
Publicar un comentario