You can use SHA-1 or in fact any of the SHA family depending upon ur actual requirements. as of today, both MD-5 and SHA-1 stand compromised but might prove good enough for ur application.
http://en.wikipedia.org/wiki/SHA-1-VijjuOn 10/31/06, howa [EMAIL PROTECTED] wrote:
Requirements:A string,
Vijendra Singh 寫道：
You can use SHA-1 or in fact any of the SHA family depending upon ur actual
requirements. as of today, both MD-5 and SHA-1 stand compromised but might
prove good enough for ur application.
http://en.wikipedia.org/wiki/SHA-1
-Vijju
On 10/31/06, howa [EMAIL PROTECTED]
If the two lists have same elements, then these *can* produce identical BSTs. as for any list, there are number of ways to construct a BST, probably you meant a balanced BST, though even that might not be unique.so in my opinion, we just need to check if the two lists have identical elements,
Well, if speed is the only criteria, then MD5 is known to be 3-4 times faster than SHA family, so your can continue using MD-5.-VijjuOn 10/31/06,
howa [EMAIL PROTECTED] wrote:
Vijendra Singh 寫道： You can use SHA-1 or in fact any of the SHA family depending upon ur actual requirements. as of today,
I have a slight improvement O ( n^2 log (n ) )Say you have a^2 + b^2 + c^2 = d.Keep a sorted list of all possible a^2 + b ^ 2 ... this would take n^2 time to generate and n^2 log n to sort. Now loop over all possible 'd' and 'c' and compute d - c ^ 2. Use binary search to determine whether that
The range for a,b,c would be 0 to sqrt(n). Iterating over all values would give complexity O(n^(3/2)).
Using bitmaps, we can determine which numbers within 0..n are not in the list of a^2 + b^2 + c^2.
I guess, here we need to assume that we have O(n) space atleast.
For making computationally
*Apologies for cross posting. Please forward to interested people*
www.PromoteResearch.org
The 2007 International Multi-Conference in Computer Science, Engineering, and Information Science will be held during 9-12 of July 2007 in
Orlando, FL, USA. The multi-conference consists of four major
I think u have misunderstood the question.
I am not asking about the two lists have identical elements or not?
If we have two lists then how will we check whther two lists produce
identical BSTs or not?
For example
L1 = { 10, 5, 15 }
L2 = { 5 , 10, 15 }
L3 = { 10, 15, 5 }
L1, L2, L3 all
Oh ok.. I got confused... lemme think about this one. I think it has a recursive soltuion but will confirm it.-VijjuOn 11/1/06, ravi
[EMAIL PROTECTED] wrote:I think u have misunderstood the question.
I am not asking about the two lists have identical elementsor not?If we have two lists then how
