@anusha i will recommend to find it free on "esnips.com"
On Sep 6, 11:51 am, Anusha K <[email protected]> wrote:
> is there a ebook of this CLRS..
>
>
>
>
>
> On Sun, Sep 6, 2009 at 5:43 PM, Mayank Jaiswal <[email protected]> wrote:
> > This book is the most awesome literature available on algorithms in the
> > market. Also used as text book in a lot of universitites.
>
> > On Sun, Sep 6, 2009 at 5:19 PM, Peter Smit <[email protected]> wrote:
>
> >> Seehttp://projects.csail.mit.edu/clrs/.
> >> > Textbook, *Introduction to Algorithms* (Second Edition) by Thomas H.
> >> Cormen <http://www.cs.dartmouth.edu/%7Ethc>, Charles E.
> >> Leiserson<http://theory.lcs.mit.edu/%7Ecel>,
> >> Ronald L. Rivest <http://theory.lcs.mit.edu/%7Erivest>, and Cliff
> >> Stein<http://www.cs.dartmouth.edu/%7Ecliff/>,
>
> >> ---
> >> +358 44 218 2700
>
> >> On Sun, Sep 6, 2009 at 1:42 PM, zoom <[email protected]> wrote:
>
> >>> well a stupid one again..
> >>> wat is CLRS??
>
> >>> On Sep 6, 2:36 pm, qasim zeeshan <[email protected]> wrote:
> >>> > Well, it was a stupid question from my side. I just didn't understand
> >>> the
> >>> > abbreviation CLRS. I actually have it :)
>
> >>> > Thanks
>
> >>> > On Sun, Sep 6, 2009 at 3:34 PM, Aditya V Daga <[email protected]>
> >>> wrote:
>
> >>> > > Search and download "cormen" from 4shared.com
>
> >>> > > On Sun, Sep 6, 2009 at 2:58 PM, qasim zeeshan <
> >>> [email protected]>wrote:
>
> >>> > >> Do anyone have CLRS?
>
> >>> > >> On Sun, Sep 6, 2009 at 12:24 PM, Viswanath <[email protected]>
> >>> wrote:
>
> >>> > >>> Yes, CLRS is a good book, but a really big one. You can also use
> >>> the
> >>> > >>> algorithms tutorials in topcoder.
>
> >>> > >>> On Sun, Sep 6, 2009 at 5:03 AM, Satyajit Malugu <
> >>> > >>> [email protected]> wrote:
>
> >>> > >>>> CLRS is the definitive book but its prettty pretty big and
> >>> intimidating.
> >>> > >>>> I have it before me and dozing off ;)
>
> >>> > >>>> On Sat, Sep 5, 2009 at 3:42 PM, SB <[email protected]>
> >>> wrote:
>
> >>> > >>>>> Kudos to these guys who prepared these qualification round
> >>> problem.
>
> >>> > >>>>> Credits
>
> >>> > >>>>> Problem A. Alien Language Written by Junbin Teng. Prepared by
> >>> Marius
> >>> > >>>>> Andrei.
> >>> > >>>>> Problem B. Watersheds Written by Andrew Gove. Prepared by Xiaomin
> >>> Chen
> >>> > >>>>> and Igor Naverniouk.
> >>> > >>>>> Problem C. Welcome to Code Jam Written by Xiaomin Chen. Prepared
> >>> by
> >>> > >>>>> Xiaomin Chen and Bartholomew Furrow.
> >>> > >>>>> Contest analysis presented by Bartholomew Furrow, Marius Andrei,
> >>> Igor
> >>> > >>>>> Naverniouk, and Xiaomin Chen.
>
> >>> > >>>>> I would like to practice algorithm questions similar to these
> >>> type ?
> >>> > >>>>> Any recommendation ???
>
> >>> > >>>> --
> >>> > >>>> Satyajit
>
> >>> > >> --
> >>> > >> Qasim Zeeshan
> >>> > >> PUCIT, PU Alumni '04
> >>> > >> Software Engineer
> >>> > >> CambridgeDocs Pakistan
> >>> > >> A Division of Document Science | EMC USA
> >>> > >>http://qzeeshan.blogspot.com/
>
> >>> > --
> >>> > Qasim Zeeshan
> >>> > PUCIT, PU Alumni '04
> >>> > Software Engineer
> >>> > CambridgeDocs Pakistan
> >>> > A Division of Document Science | EMC USAhttp://qzeeshan.blogspot.com/
>
> > --
> > Mayank Jaiswal
> > B.Tech
> > Final Year Student
> > Computer Science and Engineering
> > Indian Institute of Technology, Kharagpur
>
> > D-220, Nehru Hall of Residence
> > +91 97344 28874
> >http://www.linkedin.com/in/msjaiswal
>
> --
> The Best Way to Make Ur dreams True Is To Wake Up;)!!- Hide quoted text -
>
> - Show quoted text -
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en
-~----------~----~----~----~------~----~------~--~---
