Is there a heuristic or function to determine if two arrays of integers are alike or similar
-
05-11-2019 - |
Question
What I am trying to do is determine "closeness" or how similar are arrays of integers (or byte arrays, doesn't matter). For example, let's say a = [0, 1, 2, 3, 4]
, b = [0, 2, 1, 3, 4]
, and c = [1, 4, 2, 0, 3]
. Is there a function to determine that a
is closer to b
than c
is?
So the function I am looking for I think should be similar to SHA, but without the avalanche effect. The examples I give is using arrays of integers, but obviously this should also work on any arbitrary stream of data.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange