Hashing an permutation of 0 and 1

Revision en1, by fullbuster, 2017-06-19 13:12:00

I am trying to learn hashing and for this i am solving a problem in which there are n array's of 0 and 1 and given two arrays we have two tell whether they are equal or not.

I have heard that this problem can be solved using hashing but i am unable to come up with a hash function which can give a unique hash value for a given permutation of 0 and 1 in form of array.

Can someone suggest me such a hash function and also how to prove that it is valid.

Tags hashing


  Rev. Lang. By When Δ Comment
en1 English fullbuster 2017-06-19 13:12:00 492 Initial revision (published)