Bible of Algorithms

This is the most prefferable book for competitive programmers you can download it at http://folk.ntnu.no/nicolaat/uni/Algdat/%5BThomas_H._Cormen,_Charles_E._Leiserson,_Ronald_L.(BookFi.org).pdf

Comments

Post a Comment

Popular posts from this blog

Good schedule to follow for becoming better at competitive programming for beginners

The three most important things in competitive programming: Learn and know your programming language. (~3 months - all the time) Learn algorithms/data structures and implement. (~9 months - all the time) Practice coding every day. Do contests. (all the time) (Doesn’t just apply to competitive programming) Have fun! (all the time) Thus, that’ll be how you break up your schedule. The time it takes for each person will differ, depending on if you already know algorithms, if you know programming or not, etc. The following is a more detailed how: #1 Learn and know your programming language. Pick a programming language and stick with it. Learn the basic syntax and start solving beginner problems. People always ask “how do you learn a programming language?” Search Google and find out; there are so many resources online. (If you really can’t find a resource, message me.) Try out USACO training pages. Or if you don't you can use the CodeChef beginner track: beginner | CodeChe
Read more

Forget Efficiency and start solving easier problems

Sometimes, you may notice that many programmers solved many problems but they made very few submissions (they are geniuses!). At first, you may think that I should try to solve the problems as less try as possible. So, after solving a problem, you will not want to try it again with other algorithm (may be far far better than the previous algorithm you used to solve that problem) to update your rank in the rank lists. But my opinion is that if you think so you are in a wrong track. You should try other ways as in that and only that way you can know that which of the algorithms is better. Again in that way you will be able to know about various errors than can occur. If you don’t submit, you can’t know it. Perhaps a problem that you solved may be solved with less time in other way. So, my opinion is to try all the ways you know. In a word, if you are a beginner forget about efficiency. Find the easier problems.Those problems are called ADHOC problems. You can find the list of those prob
Read more

How to study CLRS?

Well, you should read this book from Start to end (From Basics to Masters). Here are my suggestion on How to read this Book.  Reading and Understanding CLRS: 1.  Use video lectures to understand the concept, and read the chapter from the book. Best site for CLRS lecture videos :  Lecture 1: Administrivia, Introduction, Analysis of Algorithms, Insertion Sort, Mergesort Video Lectures | Introduction to Algorithms (SMA 5503) | Electrical Engineering and Computer Science | MIT OpenCourseWare Peteris Krumins  has published a series of blog posts covering the lectures. You can  also find his lecture notes for each video. Start with this one:  http://www.catonmat.net/b log/mit... . What if you're not understanding Mathematical equations and Proofs, functions given in the Book?  1.  Watch Videos on Discrete mathematics by Arsdigita University Course 02: Discrete Mathematics (Arsdigita University) : Free Download & Streaming : Internet Archive   In parallel with it read  Discrete mathe
Read more