Re: Duplicate Detection in an arbitrary set

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Andrew Haley wrote:
> Tyler Earman wrote:
>> Hmm these seem like good options.  I was hoping to have a more portable
>> algorithm (language-wise), but its not necessary really.  As long as the
>> runtime performance is around O(n*logn) or better.
>
> I'm not quite sure what you mean by more portable; I can't think of any
> more portable structure than a hash table.
>
> Andrew..
>
I agree with Andrew your best bet is a hash table, its a nice data
structure to implement because its simple to understand you just need
to find a good hash function. But its worth it because its very fast
and works well. If you want examples if you take a poke at git-core
hash a nice example.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkqTBtMACgkQAhcOgIaQQ2GXrQCeOqh/quMP5aHQbXc151kumQ+O
7fQAn3VkM93H724U6CY+83WUlobUF10z
=sn2p
-----END PGP SIGNATURE-----


[Index of Archives]     [Linux C Programming]     [Linux Kernel]     [eCos]     [Fedora Development]     [Fedora Announce]     [Autoconf]     [The DWARVES Debugging Tools]     [Yosemite Campsites]     [Yosemite News]     [Linux GCC]

  Powered by Linux