Programming Exercise #3

[Tolnaftate2004]

Originally Posted by Inverness

Well, after having this explained to me I'm kinda ticked that this wasn't even pointed out from the start.

This has always been the point of the Programming Exercises. Perhaps you need to think differently to solve this problem by better methods, rather than the obvious...

@Chris, you started your algorithm 355 years into the future? Also you fail at subtracting.

e: Here are exact (well, kinda) loop count functions for the algorithms (n=str.length()):
Inverness:
Where epsilon (the E) is a number representative of the other loops that lead to 'continue;'. The script could be adjusted slightly to eliminate this term.
DrakilorP2P:
It should be pretty obvious where I get the O(n^2) from...

[cbk1994]

Originally Posted by Tolnaftate2004

Chris, you started your algorithm 355 years into the future? Also you fail at subtracting.

PSHAW

[Inverness]

Originally Posted by Tolnaftate2004

This has always been the point of the Programming Exercises.

Very nice of you GSTs to give programming exercises without explaining the point.

You also have yet to point out to others what functions they should be avoiding and why.

Originally Posted by Tolnaftate2004

Perhaps you need to think differently to solve this problem by better methods, rather than the obvious...

Like I've said, if your ranking system/method of measuring had been pointed out in the first place then maybe I would have made a script thats better on your ranking system instead of on Graal's.

You need to come down to the level of us mortals.

[Tolnaftate2004]

Originally Posted by Inverness

Very nice of you GSTs to give programming exercises without explaining the point.

Originally Posted by Kristi in Programming Exercise #1

So, there is a lot of help around here dealing with syntax of scripting, but I don't see much discussion on best algorithms. Be this the case, I am going to every so often (when I feel like it) post some mathematically cool problem for you all to help each other solve and break some mental barriers.

...
Remember, the goal is to make this as efficient as possible with graal script.

Originally Posted by Inverness

You also have yet to point out to others what functions they should be avoiding and why.

Do you want me to rank them or tell you how efficient I think they are? x-x

Originally Posted by Inverness

Like I've said, if your ranking system/method of measuring had been pointed out in the first place then maybe I would have made a script thats better on your ranking system instead of on Graal's.

The theory behind big-O notation is that it should be an accurate measure of code efficiency regardless of language or hardware. Different servers run the same code in different time. Additionally, though big-O is only an approximation, it is most accurate for LARGE n.

I don't see what you're so upset about, you made a good contribution.