• Cite/Export
  Cite/Export

  Copy a citation

  APA (6th ed.)

  

  Chicago (Author-Date, 15th ed.)

  

  Harvard (18th ed.)

  

  MLA (7th ed.)

  

  Turabian (6th ed.)

  

  Export a citation

  Export to RefWorks   Export to EndNote / Reference Manager   Export to EasyBib
  Export to EndNote / Reference Manager(non-Latin)   Cancel

  Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
• Print
• E-mail
  E-mail

  All fields are required.

  The E-mail Address(es) field is required. Please enter recipient e-mail address(es).

  The E-mail Address(es) you entered is(are) not in a valid format. Please re-enter recipient e-mail address(es).

  You may send this item to up to five recipients.

  Enter recipient e-mail address(es): Separate up to five addresses with commas (,)

  The name field is required. Please enter your name.

  Enter your name: The subject field is required. Please enter the subject. Subject:

  The E-mail message field is required. Please enter the message.

  E-mail Message: I thought you might be interested in this item at http://www.worldcat.org/oclc/46792720 Title: Introduction to algorithms Author: Thomas H Cormen Publisher: Cambridge, Mass. : MIT Press, ©2001. ISBN/ISSN: 0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962 OCLC:46792720

  
  

  Please verify that you are not a robot.

  Cancel
• Share
• Permalink
  Permalink

  Copy this URL to link to this page:

• Write a review
• Rate this item:
• • 1
  • 2
  • 3
  • 4
  • 5

Introduction to algorithms

Author:	Thomas H Cormen
Publisher:	Cambridge, Mass. : MIT Press, ©2001.
Edition/Format:	Print book : English : 2nd edView all editions and formats
Summary:	The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.  Read more...
Rating:	(not yet rated) 0 with reviews - Be the first.
Subjects	Computer programming. Computer algorithms. Programming. View all subjects
More like this	User tags User lists Similar Items