=== nim-0001: sequtils.deduplicate — O(N²) result.contains in for loop ===
N=100   k=100  : defective=0.102ms  fixed=0.004ms  speedup=25.1x
N=500   k=500  : defective=2.589ms  fixed=0.024ms  speedup=107.0x
N=1000  k=1000 : defective=9.896ms  fixed=0.045ms  speedup=218.5x
N=2000  k=2000 : defective=36.469ms  fixed=0.097ms  speedup=374.3x

=== nim-0002: trees.cyclicTreeAux — O(N²) linear visited-seq scan in recursive DFS ===
N=100   k=100  : defective=0.088ms  fixed=0.003ms  speedup=25.3x
N=500   k=500  : defective=2.125ms  fixed=0.036ms  speedup=59.7x
N=1000  k=1000 : defective=11.272ms  fixed=0.048ms  speedup=236.5x
N=2000  k=2000 : defective=35.849ms  fixed=0.096ms  speedup=372.8x

