Date: 2002-01-10 02:55 pm (UTC)From: [identity profile] stipe.livejournal.com
"Prove that this algorithm has a best-case running time of O(n) and a worst-case running time of big-omega(nlogn)".

Gahh... I think I've forgotten what everything but big-O notation means at this point.
If you don't have an account you can create one now.
HTML doesn't work in the subject.
More info about formatting

If you are unable to use this captcha for any reason, please contact us by email at support@dreamwidth.org

 
Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.

Profile

chess: (Default)
Michelle Taylor

January 2025

S M T W T F S
   1234
567891011
12131415161718
19202122232425
262728293031 

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Jan. 4th, 2026 09:49 am
Powered by Dreamwidth Studios