How much memory may a HPPL program use on a G2?

[Stefan Falk]

Hello everybody,

What a nice discussion!

In this specific program, I only need to know if or of not a given solution was already found (just rotated or mirrored), but the number of that existing solution is only interesting for displaying it. Also, all of my substrings would be of the same size, so I could easily compute the solution number from the INSTR position.

I guess string search is so much faster because INSTR - I assume - is implemented with a sophisticated algorithm like Bayer-Moore or so.

Something like a hash table does not exist in the Prime, does it?

Best Regards,
Stefan