Question: A deterministic algorithm with a random behavior

Hello again,

Everytime I start an (I thought deteministic) algorithm the number, how often a loop run through, is different. That makes debugging and profiling hard. But tests say, the algorithm works well.

I analized my code, I think different set orders can cause the problem.

Can indexing a set change its order ?
Can set operations like minus or union gives different result-orders in different times?

Can a set operation like minus or union change the order of the origin sets?

Please Wait...