General information
Category:
Coding, syntax & commands
Environment versions
Network:
Windows 2008 Server
- All gentleman code was based on brute force, on wich every iteration of the algorithm caused equal or more work in each step. In example, Tore's algorithm read all the info in a table and uses the SQL engine to order it, while Dragan's algorithm uses a variable on which in every iteration is bigger and the search of subtsr is longer
- Your algorithm, on the opposite side, is strategy, and you keep reducing the source string a lot in each step, so the next iteration the search work is less every time.
I was really amazed by your thinking on this question, and it is something te be learned.
Thanks for the lesson :)
LOL!!! My pleasure.
Previous
Next
Reply
View the map of this thread
View the map of this thread starting from this message only
View all messages of this thread
View all messages of this thread starting from this message only