I thk it uses balanced trees (like Red Black Trees).
Not sure though
On Thu, May 29, 2008 at 12:16 PM, Vinodh <[EMAIL PROTECTED]> wrote:
>
> I am reading about hashing techniques.
> The map data structure available in C++ STL uses hashing techniques?
> >
>
--~--~-~--~~~--
Hi,
map container in STL uses balanced binary search tree. It does not use
hashing technique.
Thanks,
Raghavendra
On Thu, May 29, 2008 at 12:16 PM, Vinodh <[EMAIL PROTECTED]> wrote:
>
> I am reading about hashing techniques.
> The map data structure available in C++ STL uses hashing techniques
I am reading about hashing techniques.
The map data structure available in C++ STL uses hashing techniques?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to
Often I find it easy when people explain things in an informal manner.
For example the artcile on logarithms from www.math.utah.edu/~pa/math/log.html
. Otherwise I don't mind asking any silly questions, whoever makes me
undersatnd something is my teacher.
On May 28, 5:33 pm, Dave <[EMAIL PROTECTE
You have the answer this is standard Maximum bipartite matching problem.
regards,
Arun.
On Wed, May 28, 2008 at 7:26 AM, Zeratul <[EMAIL PROTECTED]> wrote:
>
>
>
> On May 28, 10:16 pm, "Ajinkya Kale" <[EMAIL PROTECTED]> wrote:
> > On Wed, May 28, 2008 at 1:53 PM, Zeratul <[EMAIL PROTECTED]> wrot
Algogeeks is for helping you solve specific problems. If you have any doubts
in specific questions please post here and you may find an answer.
regards,
Arun.
On Tue, May 27, 2008 at 10:14 PM, 王帅 <[EMAIL PROTECTED]> wrote:
> yes,it is the same problem i face.
>
> 2008/5/28 Mohan <[EMAIL PROTECTE
On May 28, 10:16 pm, "Ajinkya Kale" <[EMAIL PROTECTED]> wrote:
> On Wed, May 28, 2008 at 1:53 PM, Zeratul <[EMAIL PROTECTED]> wrote:
> > We can pair a white pin located at with a black pin located
> > at if x1 > x2 and y2 > y2.
>
> you mean y1 > y2 right ?
>
Yes
>
>
> > My idea is to firs
On Wed, May 28, 2008 at 1:53 PM, Zeratul <[EMAIL PROTECTED]> wrote:
>
> On a board there are N * 2 pins colored with either black or white.
> The number of black pins is equal to that of white ones.
>
> Each pin has a location , and x y are all integers (there are no
> more than one pins on the sa
On a board there are N * 2 pins colored with either black or white.
The number of black pins is equal to that of white ones.
Each pin has a location , and x y are all integers (there are no
more than one pins on the same location)
We can pair a white pin located at with a black pin located
at
Ask a question whose answer might help you begin to understand.
Dave
On May 28, 4:51 am, Vinodh <[EMAIL PROTECTED]> wrote:
> The article does not make me understand even after a serious reading.
>
> On May 28, 2:42 pm, "Lukas Šalkauskas" <[EMAIL PROTECTED]>
> wrote:
>
>
>
> > here it is:http://e
The article does not make me understand even after a serious reading.
On May 28, 2:42 pm, "Lukas Šalkauskas" <[EMAIL PROTECTED]>
wrote:
> here it is:http://en.wikipedia.org/wiki/Asymptotic_analysis
>
> On Wed, May 28, 2008 at 12:27 PM, Vinodh <[EMAIL PROTECTED]> wrote:
>
> > Hi can anyone provide
here it is:
http://en.wikipedia.org/wiki/Asymptotic_analysis
On Wed, May 28, 2008 at 12:27 PM, Vinodh <[EMAIL PROTECTED]> wrote:
>
> Hi can anyone provide a simple easy to understand definition of
> "Asymptotic Analysis"
>
>
>
> >
>
--
You can contact me by :
Home page: http://www.revidev
Hi can anyone provide a simple easy to understand definition of
"Asymptotic Analysis"
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@goog
13 matches
Mail list logo
