Other than algorithms Question

0 views

Skip to first unread message

unread,

Nov 10, 2010, 10:01:22 AM11/10/10

to design-and-analy...@googlegroups.com

I have one that I have been trying for a while

Prove that logn! is O(nlong) and omega(nlogn)

the O(nlogn) is easy

but I'm stuck at the omega

--
Kyle deFreitas
St Vincent and the Grenadines
Contact #: 1-784-454-4037
or
1-868-722-5346

Reply all

Reply to author

Forward

0 new messages