Algorithm Geeks Google Group

Home Business Online - How to Start a Home Business

zurlinton.ma...@gmail.com (mark zurlinton) — Sun, 07 Sep 2008 15:50:33 UT

Home Business Online - How to Start a Home Business
[link]

Pesonal Loans For Bad Credit Help People in Difficult Times

zurlinton.ma...@gmail.com (mark zurlinton) — Sun, 07 Sep 2008 15:49:28 UT

Pesonal Loans For Bad Credit Help People in Difficult Times
[link]

Traetment for cancer

zurlinton.ma...@gmail.com (mark zurlinton) — Sun, 07 Sep 2008 15:48:42 UT

Traetment for cancer
By natural medicine no side effect thousands of patients benefited
[link]

Meet Your Ideal Match

zurlinton.ma...@gmail.com (mark zurlinton) — Sat, 06 Sep 2008 15:45:31 UT

Meet Your Ideal Match
Join this exciting singles site. Meet new people online. 100% free.
[link]

If You Download Pop Music The Right Way You Can Get Exactly What You Want

zurlinton.ma...@gmail.com (mark zurlinton) — Sat, 06 Sep 2008 15:43:40 UT

If You Download Pop Music The Right Way You Can Get Exactly What You Want
[link]

PC to Phone Calls

zurlinton.ma...@gmail.com (mark zurlinton) — Sat, 06 Sep 2008 15:42:54 UT

PC to Phone Calls
[link]

Direct TV - FREE?

zurlinton.ma...@gmail.com (mark zurlinton) — Sat, 06 Sep 2008 15:40:51 UT

Direct TV - FREE?
[link]

Re: [algogeeks] Re: intersection

aryansmit3...@gmail.com (sharad kumar) — Sat, 06 Sep 2008 14:56:40 UT

in case of sets of sets of word we need to tokenize each set of word .
use
for(int i=0;(a[i]!='\0')||(a[i]=='\b') ;i++)
int a+=a[i];
once tokenize
we need to appedn them in a vector just line we use the type as string .we
need to use the brute force for it.

Re: intersection

dave_and_da...@juno.com (Dave) — Sat, 06 Sep 2008 12:33:52 UT

This is not a very general algorithm. For example, how would you use
it to find the intersection of two sets of words?

Dave

intersection

aryansmit3...@gmail.com (sharad kumar) — Sat, 06 Sep 2008 08:50:05 UT

in order t ofind intersection of 2 sets just
use counting principle of finding the the of times each element
ocucurs in each set .then we find check if 2 sets have a aprticular no
same times then we include it in the new set .
in case of union we use principle of merge sort in additon to this
above principle.

Re: [algogeeks] Re: greedy question, hope someone can help

nuda...@gmail.com (Nuda LU) — Sat, 06 Sep 2008 08:11:02 UT

I can solve a and b but c is difficult to prove

Re: [algogeeks] Re: greedy question, hope someone can help

nuda...@gmail.com (Nuda LU) — Sat, 06 Sep 2008 07:04:37 UT

thank you very much, can you help me to solve another problem
Given positive integers m n, you are to tile an m n room with square
tiles, minimizing the number
of tiles used.
(a) Give a greedy algorithm for tiling the room.
(b) Give an example on which your greedy algorithm does not give an optimal

Please connect with me :)

kumaragur...@gmail.com (Kumaraguru Paramasivam) — Fri, 05 Sep 2008 15:07:41 UT

Hi,
I looked for you on Reunion.com, but you weren't there. Please connect with me so we can keep in touch.
-Kumaraguru
Do You Know Kumaraguru?
YES - Connect with Kumaraguru, and see who's searching for you
[link]
NO - I don't know Kumaraguru
[link]

POOJA TRAINING FOR FRESHER’S & PROFESSIONALS IT & NON-IT .

poojatrain...@gmail.com (Pooja) — Fri, 05 Sep 2008 11:29:04 UT

Professionals with extensive knowledge and experience, both in
training and development are a part of our team of trainers. Single
minded dedication, effective work culture and dynamic decision making
under impossible situations are our strengths. Quality without
compromise is our motto.

TRAINING CONDUCTED IN FOLLOWING LANGUAGES :

POOJA TRAINING FOR FRESHER’S & PROFESSIONALS IT & NON-IT .

poojatrain...@gmail.com (Pooja) — Fri, 05 Sep 2008 11:29:27 UT

TRAINING CONDUCTED IN FOLLOWING LANGUAGES :