Lawrence D'Oliveiro wrote:
> On Sun, 22 Sep 2024 00:18:09 +0200, fir wrote:
>
>> ... you just need to read all files in
>> folder and compare it byte by byte to other files in folder of the same
>> size
>
> For N files, that requires N × (N - 1) ÷ 2 byte-by-byte comparisons.
> That’s an O(N²) algorithm.
>
> There is a faster way.
>
not quite as most files have different sizes so most binary comparsions
are discarded becouse size of files differ (and those sizes i read
linearly when bulding lidt of filenames)
what i posted seem to work ok, it odesnt work fast but hard to say if it
can be optimised or it takes as long as it should..hard to say
|
|