I came up with my approach when I saw that the distribution of 1s was very sparse. As the density of 1s increases, the routine gets progressively slower.
None the less, the challenge is met and I stand corrected.
In reply to Re^7: Comparing two arrays
by BrowserUk
in thread Comparing two arrays
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |