Archived

This topic is now archived and is closed to further replies.

Algorithms book

This topic is 6115 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

The Art Of Computer Programming
Volumes 1-3

by Donald E. Knuth


"The bible of all fundamental algorithms and the work that taught many of today''s software developers most of what they know about computer programming."-- Byte, Sept 1995



Ptim

-=-=-=-
A M I N O T
M E R C I F U L ! ? ! ?

Share this post


Link to post
Share on other sites
quote:
Original post by Magmai Kai Holmlor

Exellent reference (even if the code sucks - it''s quite efficent, but UG-GL-LY. It''s ported from fortran and it shows - no, it screams.)



I whole-heartedly agree. I used its FFT algorithms recently, and added code to the function so that it would decrement the pointer internally (even if it is a little less efficient). There was just no way I would force a user to do this:
data[400];
fft (data-1, 400);
GAACK!

(for those who haven''t read it, Numerical Recipies refers to all arrays as 1-based instead of 0-based, so you pass in the pointer minus 1).

Still, the algorithms themselves do kick some major can.

Share this post


Link to post
Share on other sites