Algorithms Part I and Part II by Sedgewick focus on his book while Design and Analysis of Algorithms Part I and Part II by Tim Roughgarden uses CLRS. There’s also a few courses for these books on Coursera. It’s a very comprehensive book and it provides implementations in pseudocode for the algorithms it covers. Introduction to Algorithms by CLRS is more mathematically oriented than Sedgewick’s book. You can translate the Java code into any language you’d like. It provides Java code for the algorithms it covers, which includes DFS, BFS, Minimum Spanning Trees, and all sorts of good stuff. CLRS (a.k.a Introduction to Algorithms by Cormen and some other guys as noted by Algorithms by SedgewickĪlgorithms by Sedgewick is more suited for beginners, so I recommend going there. If, however, you’d like to go into the algorithms related to graphs, there are two books I recommend. I like both the CLRS book and Mathematics of Computer Science ( ) The basics of graph theory are pretty simple to grasp, so any text would suffice.
0 kommentar(er)
