hello
i have an algorithm that i try to figure out it's complexity
for x = 1 to n/2
for y = x to n-x
for w = x to y
do (operation)
is it some kind of a familiar series?
how do i analyse it?
thanks
mike
| CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
|
Results 1 to 6 of 6
Thread: Algorithm ComplexityThreaded View
Tags for this Thread |
Click Here to Expand Forum to Full Width |