Hi,
In reality there is no perfect hash function since database tend to store
large data...hash may get destructive many time if hash function is not
correctly..BTrees gives us bushy nature so...its fast as compared..
Now-a-days BTrees usage has also got down...databases are now using R-trees
and
Hi,
please explain your problem clearly..u have just given the mapthere are
many popular alogs...like Travelling salesperson algo,Dijkstra shortest
path,Bellmond ford shortest path,All pairs shortest path depending on the
problem..
cheers,
koushiki chitta
On 4/18/07, Lukas Šalkauskas <[EMAIL
A programmer friend of mine told me that research was done and for
database applications, B-Trees were faster on average as opposed to
hashes.
I thought about this for a minute and could only come up with maybe
the amount of data they are storing is so large that a resonably
unique hash function
all the three statements following else shud be inside else block.
On 4/18/07, pramod negi <[EMAIL PROTECTED]> wrote:
>
> I think this always return height 1. isn't it
>
> On 4/17/07, BiGYaN <[EMAIL PROTECTED]> wrote:
> >
> >
> > We will be calling the function like :
> > height = getheight(root);
I think this always return height 1. isn't it
On 4/17/07, BiGYaN <[EMAIL PROTECTED]> wrote:
>
>
> We will be calling the function like :
> height = getheight(root);
>
> and here's the function defination :
> int getheight ( node *p )
> {
>if ( p==NULL )
>return 0;
>else
>rh
