Yeah, its BST(given that each node's data is different from others.)
-Moheed
I am who I am, no matter where I am or who I am with.
*
*
On Fri, Feb 10, 2012 at 5:07 PM, Manni mbd mbd2...@gmail.com wrote:
are you sure u want to ask BINARY SEARCH treees and not Binary trees..
On 1/29/12,
It will be very helpful if u could tell me for binary search tree and
binary tree both...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
mirror of tree
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
How can we check for the primality for very large number like 10^20 or
more. It is not stored in integer So integer operation would not work
on it.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
what are the efficient ways to check that a given number is primer
assuming the numbers can be large.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
There are many, but the one i know how to code is fermat's primality test.
How to calculate all prime numbers between a given range efficiently i read
somewhere that we can do bit-masking to store whether a number is prime or
not, thus saving space ?
I generally use double prime sieve.
On Sat,
There are deterministic polyomial-time algorithm. [AKS-primality]
Miller-Robin primality test is a non-deterministic primality test with
almost zero
chance of error.
[All above based on some modification/improvement on fermat's theorem]
GNU Multi Precission library can be used to handle large
