An introduction to the subject of data structure and algorithm programming, typically covered in second year computer science courses. Deemphasizing software engineering, the volume's 15 chapters cover: arrays, stacks and queues, simple sorting, linked lists, recursion, advanced sorting, binary trees, red-black trees, 2-3-4 trees and external storage, hash tables, heaps, and weighted graphs. The CD-ROM contains visual simulations of algorithm examples from the book. Annotation c. by Book News, Inc., Portland, Or.
The best book I've found on Data Structures and Algorithms in Java for beginners. Content is properly organized, nice illustrations and easy-to-understand explanations. It covers general purpose data structures like Arrays, Linked lists, HashTables and Binary Trees, special purpose data structures like Stacks, Queues and PriorityQueues, sorting algorithms and lastly Graphs.
Note that this is a beginners book, it can act as an interview refresher and solidify your understanding on Computer Science fundamentals in terms of data structures and algorithms.
This is the best book you can find on Earth as of now. Perfect explanation of concepts with examples.If you're not someone who come from a computer science background but works as a software engineer even then you can learn D.S from it very easily.
You just need to know Java and this book will take you further.Most gurus lists will tell you that "Introduction to Algorithms" and others is the book to buy in this field. I would strongly disagree with this notion unless the reader is already very savvy in DS&A and good with numbers.
As an amateur programmer looking to learn what exists beyond arrays, this book was great. I got a very clear overview of the different types of data structures and their attributes, implementation tips, and good code examples.
The book covers all the important topics in regard to DS&A 鈥� arrays, stacks, queues, link lists, trees, heaps, hashtables, Graphs, recursion, sorting algorithms and few other graph related algorithms. The explanations are great, and the code examples are detailed for every data structure and algorithm, everything is developed from scratch. There鈥檙e plenty of workshops applets, though I didn't even check if they鈥檙e available because I had no problem to imagine how the algorithms work step by step. The Red-Black tree chapter explains exactly how it works, though there鈥檚 no code implementation, and it was nice if it had one. The weighted Graph chapter could have been edited better to my taste, though it鈥檚 fine.
All in all it鈥檚 a good book on DS&A, and I highly recommend this book to anyone who鈥檚 interested in this topic. Sedgewick鈥檚 book sounds like a good book to take a step further and dive into algorithms. 4.5-4.75/5
This is first time ever I read any Data Structures and Algorithms. After almost completing this book I found this book is good for learning concepts. The applet provided are great pictorial presentation.
This book is Bible for people who want to understand every why's and how's of each data structure topic along with Java code . I have read it to understand the basics prior to get ready for challenging interview questions . In the end of book i can connect the dots as what problem leads to other data structure and ADTs . All i can say is that I'm a happy programmer after completing this book . (:
The name is a bit of a misnomer, it does not through luck explore algorithms, aside from Dijkstra's algorithm most others relate to ADT's, such as red and black or AVL trees. That being said, it's still a good book for introducing the basics for data and abstract data types.
This is an excellent book on Data Structures and Algorithms, for some reason my teacher chose a book that isn't nearly as good, but this one really helped me to understand what the different algorithms are doing. Especially some of the more abstract ones like Hash Tables and Graphs.
Jest to kolejna ksi膮偶ka z kanonu informatyki, kt贸r膮 przeczyta艂em. Zbieram ca艂膮 kolekcj臋. Ksi膮偶k臋 t臋 przeczyta艂em po raz pierwszy oko艂o 8 lat temu i mia艂em podobne wra偶enia z lektury: napisana do艣膰 przyst臋pnym j臋zykiem, jak na stopie艅 skomplikowania zagadnienia. Nie ma za du偶o wzor贸w - co mo偶e by膰 zar贸wno plusem, jak i minusem, w zale偶no艣ci od tego, czego szukamy. Z drugiej strony, znajduj膮 si臋 w niej r贸wnie偶 bardziej skomplikowane zagadnienia, takie jak Radix Sort czy Algorytm Shella, drzewa czerwono czarne wraz z rotacjami, kt贸re zazwyczaj nie wchodz膮 do tego typu "uproszczonych" ksi膮偶ek o algorytmach.
My艣l臋, 偶e to w miar臋 dobra ksi膮偶ka na pocz膮tek przygody z algorytmami, szczeg贸lnie ko艅cowe rozdzia艂y s膮 do艣膰 przydatne. Mankamentem ksi膮偶ki jest jako艣膰 kodu napisanego w Javie. Autor ma do艣膰 osobliwe poczucie estetyki kodu, kt贸re kontrastuje z przyj臋tymi w 艣rodowisku Java standardami.
Jestem na 录 obj臋to艣ci s艂ynnej ksi膮偶ki o algorytmach Cormena i jest to ksi膮偶ka, kt贸r膮 podczytuj臋 ju偶 od roku. Nie znam trudniejszej ksi膮偶ki, i je艣li kto艣 zna, niech mnie przekona. Je艣li kto艣 jest zainteresowany bardzo matematycznym podej艣ciem do algorytm贸w, to my艣l臋, 偶e nie ma lepszej ksi膮偶ki ni偶 w艂a艣nie Cormen - Wprowadzenie do algorytm贸w.
What an amazing book. Lafore as a way of manifesting a code that is both simple and easy to digest. However this is not a book to glance at, you should either devour it page by page or don't bother reading it at all
best algs book i've ever read. highly highly recommended. there are examples for building data scructures from scratch which helps illustrate with examples of how you would implement things.