Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

I'm reading around big O to get some concept about performance for data structures. The mathematics book recommended by the open book ~ maths for computer science

In the book (pg 456) part of the pre-requisite knowledge to understand big oh are approximate sums.

I'm struggling to get my head around some of the concepts presented in the book in regards to weakly or strongly decreasing or increasing approximate sums. How exactly can a sum be weak or strong compared to another?

share|improve this question
I can't seem to find the phrases "weakly approximate sum" or "strongly approximate sum" anywhere in that chapter. Could you be more specific? – Antonio Vargas Feb 26 at 22:22
should be under 13.3 approximating sums :). apologies – peter_gent Feb 26 at 22:29
Are you referring to "weakly decreasing"/"strongly increasing" (etc.) functions? – Antonio Vargas Feb 26 at 23:06
yep I was referring to that. – peter_gent Feb 27 at 13:01
Try this en.wikipedia.org/wiki/Monotonic_function – Cain Mar 1 at 16:41

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.