zscoder's blog

Which book do you recommend?
By zscoder, 11 years ago, In English

I and trying to find a good book to read (on programming). Which book do you recommend?

  • Vote: I like it
  • +1
  • Vote: I do not like it

Comments Comments (20)
| Write comment?
»
11 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Algorithm Design Manual by Skiena..

→ Reply
»
11 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

Thomas H. Cormen — Introduction to algorithms

→ Reply
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Competitive Programming

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks! I already got that one, but I think it requires some advanced knowlegde (to me) , so I and finding a simpler and more detailed book. Thanks again!

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it -18 Vote: I do not like it

      It was 3 years ago, probably you have already read or skimmed that book) Do you recommend it for novice?

      → Reply
»
11 years ago, # |
  Vote: I like it +2 Vote: I do not like it

exactly books of Cormen

→ Reply
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Introduction To Algorithms With A Creative Approach
Udi Manber

→ Reply
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think you must read Introduction to Algorithms

→ Reply
»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

I think this book is pretty easy to read:

Algorithms: Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani

Official copy is available at home page of Umesh Vazirani at berkeley.edu:

0: Prologue

1: Algorithms with numbers

2: Divide-and-conquer algorithms

3: Decompositions of graphs

4: Paths in graphs

5: Greedy algorithms

6: Dynamic programming

7: Linear programming and reductions

8: NP-complete problems

9: Coping with NP-completeness

10: Quantum algorithms

For beginners it's easy to read introduction to algorithms since it's not too formal style (chaps 0-6).

For experienced coders, it still could be interesting introduction to theoretical computer science (chaps 8-10).

→ Reply
»
8 years ago, # |
  Vote: I like it +29 Vote: I do not like it

For example Julius Evola: Revolt Against the Modern World.

Oh, on programming...

→ Reply
»
7 years ago, # |
  Vote: I like it +38 Vote: I do not like it

I am curious zscoder, what book did you choose?

→ Reply
»
3 years ago, # |
  Vote: I like it +70 Vote: I do not like it

zscoder which books you used ?

→ Reply
»
3 years ago, # |
  Vote: I like it -24 Vote: I do not like it

Your ratings are too high and you may ask tourist

→ Reply