If you are a computer science graduate, you might have heard about Big-O. It’s basically a way to analyze the performance of your algorithm. There are lots of web pages that go in deep to explain Big-O, for example Harvard University page dives deep into this concept. I was looking for pretty simple explanation, finally found it at http://www.perlmonks.org/?node_id=227909
Related Link: Big-O Notation – What it is good for?
- Happy New Year!
- Prostitution thru Craigslist