It''s funny you ask necause I seem to have been taking a previous year''s exam and run across a question about it, but had never heard of it let alone know what they were talking about...

I Also would like to have some info on what it is... Thanx a lot!

Dwiel

'big o notation' first link on google:http://www.nist.gov/dads/HTML/bigOnotation.html
especially follow the 'more information' links at the bottom




[edited by - burning_ice on May 1, 2003 8:06:15 PM]

Thanks a lot for your help! Sorry that I didn't search on Google first, I should have thought of that.

BTW (to Tazzel3D)- Big O notation is a method of classifying algorithms by how efficient their run-times are. You typically use the number of items the algorithm is acting on as n. So, an algorithm that looks at all n items, or some part of n directly proportional to the number of items would be O(n). An algorithm that wasn't at all affected by the number of items in n would be O(1). Something like a binary search would be O(log n), while an insertion sort would be O(n^2). The article Burning_Ice gave can explain it better than I can.

[edited by - sofsenint on May 1, 2003 10:51:48 PM]