Re: Complexety of algorithm

Tech Tip: Click here to run a free scan for Windows Errors and optimize PC performance

From: "Brian Gideon" <briangideon@xxxxxxxxx>
Date: 14 Jun 2005 09:36:29 -0700

Brian Gideon wrote:
>
> x^2 x^2
> So f(x) = Integral[g(x), dx] = --- log(x) - --- + E
> 2 4
>

For those not using a fixed-width font:

f(x) = Integral[g(x), dx] = (x^2/2)*log(x) - (x^2/4) + E

.

References:
- Complexety of algorithm
  - From: Allan Ebdrup
- Re: Complexety of algorithm
  - From: Brian Gideon

Prev by Date: Re: COM Object performance in different Threads
Next by Date: Variable for Casting?
Previous by thread: Re: Complexety of algorithm
Next by thread: system shut down problem with webbrowser
Index(es):
- Date
- Thread