What do you think?
Rate this book
Algoritmy v C
Robert Sedgewick přepsal svoji populární knihu skutečně do hloubky tak, aby odpovídala nejnovějším poznatkům a trendům. Díky ní snadno pochopíte nejdůležitější algoritmy a datové struktury. Bylo přidáno mnoho nových algoritmů a jsou vysvětleny podrobněji.
Tato kniha — tedy části 1–4 — reprezentuje polovinu uceleného souboru knih o algoritmech v C. Obsahuje podrobný výklad datových struktur a algoritmů pro třídění, vyhledávání a přidružené aplikace. Algoritmy a datové struktury jsou popisovány jako stručné implementace v C, takže je můžete nejen studovat, ale i používat v reálných aplikacích. Pochopitelně ale mohou být použity v libovolném programovacím jazyce.
Z obsahu:
Rozšířené reference k polím, řetězeným seznamům, stromům a dalším základním datovým strukturám
Podrobné rozebrání abstraktních datových typů (ADT)
Přes 100 algoritmů pro třídění, výběr, implementace front ADT a ADT vyhledávání
Nové implementace pro binomické fronty, vícecestné radix třídění, Batcherovo třídění, vícecestné stromy, BST a mnoho dalšího
Detailní informace o algoritmech – zahrnujíc v to empirické studie a základní analytické studie
Více než 1000 cvičení, která vám pomohou pochopit algoritmy ještě lépe
Tato kniha — tedy části 1–4 — reprezentuje polovinu uceleného souboru knih o algoritmech v C. Obsahuje podrobný výklad datových struktur a algoritmů pro třídění, vyhledávání a přidružené aplikace. Algoritmy a datové struktury jsou popisovány jako stručné implementace v C, takže je můžete nejen studovat, ale i používat v reálných aplikacích. Pochopitelně ale mohou být použity v libovolném programovacím jazyce.
Z obsahu:
Rozšířené reference k polím, řetězeným seznamům, stromům a dalším základním datovým strukturám
Podrobné rozebrání abstraktních datových typů (ADT)
Přes 100 algoritmů pro třídění, výběr, implementace front ADT a ADT vyhledávání
Nové implementace pro binomické fronty, vícecestné radix třídění, Batcherovo třídění, vícecestné stromy, BST a mnoho dalšího
Detailní informace o algoritmech – zahrnujíc v to empirické studie a základní analytické studie
Více než 1000 cvičení, která vám pomohou pochopit algoritmy ještě lépe
688 pages, Paperback
First published August 22, 1997
46 people are currently reading
400 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 5 of 5 reviews
April 1, 2014
Best practical book on algorithms I have stumbled upon.
Unlike CLRS this book comes with code written in C and also with a basic explanation for data structures.
The first 2 chapters are an introduction into the world of algorithms, building a perspective onto what will follow, explaining the principles governing algorithm analysis.
Next there are a few chapters on data structures, including ADTs(abstract data types) - arrays, linked lists, strings, stacks, queues, trees, graphs - and the procedures used to manipulate them. Some methods like recursion, divide and conquer and dynamic programming (memoization) are also discussed in detail.
All popular sorting methods are covered next: selection sort, insertion sort, bubble sort, shellsort, quick sort, mergesort, heapsort (with an in detailed explanation of the heap data structure), radix sort, and also some other special types of sort.
Searching is the main interest of the last half of the book. Symbol tables data structures and algorithms(most of which are tree algos) are covered in depth.
Every chapter contains a basic mathematical analysis mentioning the people that are experts in a specific domain. So if someone is interested in getting a more detailed version/explanation/analysis can easily follow the references.
Every chapter ends with a list of exercises most of which are not quite trivial. I solved only about half of them because otherwise it would take me forever to finish the book. But for a pedantic type this is a great way to improve thinking and coding skills. If someone would solve all the exercises, this will almost guarantee that the person could tackle any programming challenge with regards to algorithmic solving or choosing the right data structure for a task.
All in all, reading this book and solving the exercises, will make anybody a better programmer, no matter the skills.
Unlike CLRS this book comes with code written in C and also with a basic explanation for data structures.
The first 2 chapters are an introduction into the world of algorithms, building a perspective onto what will follow, explaining the principles governing algorithm analysis.
Next there are a few chapters on data structures, including ADTs(abstract data types) - arrays, linked lists, strings, stacks, queues, trees, graphs - and the procedures used to manipulate them. Some methods like recursion, divide and conquer and dynamic programming (memoization) are also discussed in detail.
All popular sorting methods are covered next: selection sort, insertion sort, bubble sort, shellsort, quick sort, mergesort, heapsort (with an in detailed explanation of the heap data structure), radix sort, and also some other special types of sort.
Searching is the main interest of the last half of the book. Symbol tables data structures and algorithms(most of which are tree algos) are covered in depth.
Every chapter contains a basic mathematical analysis mentioning the people that are experts in a specific domain. So if someone is interested in getting a more detailed version/explanation/analysis can easily follow the references.
Every chapter ends with a list of exercises most of which are not quite trivial. I solved only about half of them because otherwise it would take me forever to finish the book. But for a pedantic type this is a great way to improve thinking and coding skills. If someone would solve all the exercises, this will almost guarantee that the person could tackle any programming challenge with regards to algorithmic solving or choosing the right data structure for a task.
All in all, reading this book and solving the exercises, will make anybody a better programmer, no matter the skills.
April 3, 2020
S & Algorithm implemented in C. No other book I could find has this depth & code
January 17, 2025
This book was the initial part of a plan about studying algorithms. The goal is learning them from different sources sequentially and having ability to apply different languages effectively. So, I'd like to read initial part in C language, it was about fundamentals, algorithm analysis and basic data structures. I think C language is good for this because the book tells how the memory works in detail.
I've read this kind of book before but the authors choose languages such as Ruby and Javascript and those communities doesn't care so much about the memory. But the "Algorithms in C" book have to manage memory and this is why it is great for the fundamentals and algorithm analysis. The next part of the plan is reading more Data Structures and Algorithms in C++.
I've read this kind of book before but the authors choose languages such as Ruby and Javascript and those communities doesn't care so much about the memory. But the "Algorithms in C" book have to manage memory and this is why it is great for the fundamentals and algorithm analysis. The next part of the plan is reading more Data Structures and Algorithms in C++.
Want to read
May 13, 2013i didnt read the book
Want to read
January 7, 2016nice
Displaying 1 - 5 of 5 reviews