Algorithms

Hello /sci/
I'm hoping someone could recommend me a good book on algorithms, I hear they are essential for programming, but I don't want to ask /prog/ because they would just tell me to shit up and read my SICP.
Ebook preferred if possible.
Thanks for the help!

>>1
Whoops, I'm a faggot.
That's "shut up", although knowing /prog/ they would indeed shit up my thread.

I hear they are essential for programming
Really?

>>3
Yeah, I assume it's more for data processing rather than regular general purpose applications though. It'd still be cool to learn.

http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm
(not sicp)

>>5
Thanks bro.

http://www.amazon.com/Introduction-Algorithms-Third-Thomas-Cormen/dp/0262033844/ref=sr_1_1?ie=UTF8&s=books&qid=1256105041&sr=8-1

Algorithmics - The Spirit of Computing by David Harel

http://hotfile.com/dl/16399459/2efd3b5/AlgoSpiritCom.rar.html

Very nice gentle introduction to the subject. I wouldn't call it a college textbook because it doesn't approach it from a rigorous standpoint, but if you want to get the ideas behind algorithms and algorithmic design I would certainly recommend it. It touches on nice little applications such as cryptography, parallel processing, complexity theory, etc.

>>7
this is the fucking algorithms bible.  Everyone in CS needs one.
Sage because this question is now answered.

>>9
oh my god, I'm a fucking moron.  Too much time on the image boards for me...

>>1
1. fuck your for no posting this on /prog/
2. just read one of hopcraft and ulman's books on algorithms.

>>11
s/your/you/

>>4
You'd be surprised. The big list of algorithms in books like >>7 is there mostly as a reference, but thinking in terms of computational complexity in everyday programming work is very important for quality programming. (Note the "quality" here. You *can* do without, but the results aren't pretty.) Just knowing when to use a linked list and when to use a vector can be a big win in efficiency of a great many programs.

For instance, I recently had to write an efficient timer system - there'd be at least 10000 timers expiring per second, many of them recurring, to be executed in order. The goal was to optimize the number of timers per second the system could handle. Knowing the different types of priority queues available was key to this problem, and I actually referenced >>7 again for ideas.

>>10
relax bra. we all make mistakes.

>>11
this

>>13
vector
implied that >>13-kun uses Sepples
quality programming
I chortled.

>>13
Or you could google "priority queue". Just sayin'.

>>16
sepples == sicp?

>>18
C++