The article explains why hashing have o(1) complexity. This article will clear your doubt that whay hashing has 0(1) time complexity but will not...
i dont know what is happening .i haven't put even a single link or image in my post yet still it is showing this.i have spent so much time to...
sorry for late reply.
unsigned xor_hash ( void *key, int len ) { unsigned char *p = key; unsigned h = 0; int i; for ( i = 0; i < len; i++ ) h ^=...
i think iam getting what you want..you want your array to be get converted in into single integer. for eg if int a[]={1,8,5,6}; then int x = 1568...
I think you should include this point in your signature policy.lots of people including me gets confused ..
This is my solution to calculate the factorial of large numbers upto 3300 and can be extended depending on your system memory.To increase range...
Separate names with a comma.
