2

enter image description here

What language, if any, is used in this book? My school is currently using a terrible book for the algorithms course that I have to take next year and I'd like to convince the department head that Introduction to Algorithms by Cormen is a much, much better book.

Zolomon
3051 silver badge9 bronze badges
asked Apr 22, 2011 at 15:50
5
  • What book is your school using now? Commented Apr 22, 2011 at 17:02
  • Data Structures and Algorithms in Java: amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/… Commented Apr 22, 2011 at 17:36
  • 2
    I'm pretty sure they use the language 'English' in that book, but translations are probably available. Commented Feb 12, 2012 at 0:24
  • 4
    How do you know it's a better book if you haven't read it? Commented Feb 12, 2012 at 3:37
  • @Karl: This was my first thought too! Commented Feb 12, 2012 at 13:18

2 Answers 2

15

No specific programming language -- it uses a sort of natural language/math-y hybrid. "Pseudocode", you might say.*

It's a great textbook; the canonical algorithms text.

* Algorithms are usually expressed in a language-independent manner.

answered Apr 22, 2011 at 15:52
5
  • Does this book offer much in the way of an introduction to data structures? The course is technically called "Introduction to Algorithms and Data Structures". Commented Apr 22, 2011 at 15:56
  • @brewer2: yes, it does. Commented Apr 22, 2011 at 16:20
  • @brewer2: I don't have my copy handy. I recall it having some parts about trees, heaps, hash tables, graphs, and so forth. It doesn't focus on data structures per se, but it's hard to cover an introduction to algorithms without showing at least some data structure examples, too (the topics are closely intertwined). Commented Apr 22, 2011 at 16:20
  • 4
    If you can't translate the pseudocode into your favorite programming language fairly easily, you have weird taste in languages. Commented Apr 22, 2011 at 17:37
  • @joose it isn't really an intro to data structures. The stuff I covered in it was prim's and djikstra's graph algorithms. Had to figure out the basics.on my own Commented Feb 12, 2012 at 0:27
1

Its language agnostic. No language in particular. To understand the syntax of the pseudo-code you have the explanation of used conventions after first algorithm which I remember was perhaps Insertion Sort.

Yes it does have a treatment on data structures as well.

answered Feb 12, 2012 at 7:28

Your Answer

Draft saved
Draft discarded

Sign up or log in

Sign up using Google
Sign up using Email and Password

Post as a guest

Required, but never shown

Post as a guest

Required, but never shown

By clicking "Post Your Answer", you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.