The Gateway to Computer Science Excellence
0 votes
19 views
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.
in Algorithms by Boss (41.9k points) | 19 views

1 Answer

0 votes
n! = omega(2^n)

n! = n * (n-1) * (n-2) * .......2 * 1     >      2 * 2 * 2* 2*  ...... * 2 (n times)          ; n > 2, (n-1) > 2 , (n-3) >2

so, n! =  omega(2^n)

n! = n * (n-1) * (n-2) * .......2 * 1    <     n * n * n *n         *n   (n times)           ; n = n , n-1 <n ; n-2 <n ; n-3 < n

so , n! = big-O( n^n)
by (11 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,459 answers
195,377 comments
100,269 users