I am trying to find the best way to write a subroutine of Array Intersection
I tried 3 methods. - a sequential method (18 seconds) - a dichotomous search method ( 9 seconds) -and finally I learn or I try to understand how to use the SMcNeill tools and so I wrote a routine with the use of _MEM. It's difficult for me because I do not understand all the subtleties of the English language and even less those of the language "Basic" (12 seconds)
These tables are already sorted I thought the 3rd method (with _Mem) would be faster, but no. I think I have to make mistakes in using these instructions
[ This attachment cannot be displayed inline in 'Print Page' view ] [ This attachment cannot be displayed inline in 'Print Page' view ] [ This attachment cannot be displayed inline in 'Print Page' view ]