Ascending order has a set of binary data, format is as follows:

00000,,, n,,, 00001
00000.,,,,,,,,,,,,, 10
,,,,,,,,,,
00001000. 100001,,,,,,,
,,,,,,,,,

111111111. 11111,,,,,,,

A known an existing binary data

000100111. 110000,,,,,,,

How can fast in the array to find the smallest hamming distance

I did a test, direct calculation every match in the array of hamming distance, didn't find the rise and fall of hamming distance regular

If use dichotomy to find and compare the size and calculate the hamming distance, again afraid to miss the smallest hamming distance,

The problem how the teacher provides a train of thought