Hacker's Delight

Autor Henry Warren

0.0 z 5 hvězdiček 0 hodnocení čtenářů

Kniha ( pevná vazba )

Skladem 1 ks
Doručení ZDARMA od 1299 Kč, v pátek 29. 5. předáme dopravci
Osobní odběr ZDARMA ( Vyberte prodejnu )

Do košíku

1 469 Kč s DPH
Jsme transparentní

Při zaslání zboží balíčkem

K nákupu nad 99 Kč dárek zdarma v hodnotě 19 Kč

E-shopové listy

Při zaslání zboží balíčkem

K nákupu nad 499 Kč dárek zdarma v hodnotě 299 Kč

Gump: Jsme dvojka

"This is the first book that promises to tell the deep, dark secrets of computer arithmetic, and it delivers in spades. It contains every trick I knew plus many, many more. A godsend for library developers, compiler writers, and lovers of elegant hacks, it deserves a spot on your shelf right next to Knuth." --Josh Bloch (Praise for the first… Přejít na celý popis

Patrik je praktický lékař s dobrým srdcem, plnou čekárnou a životem, který mu občas přerůstá přes hlavu. Laskavý román z lékařského prostředí o obyčejných lidských starostech. Více informací

--Josh Bloch (Praise for the first edition)

In Hackerâ€™s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warrenâ€™s hacks are eminently practical, but theyâ€™re also intrinsically interesting, and sometimes unexpected, much like the solution to a great puzzle. They are, in a word, a delight to any programmer who is excited by the opportunity to improve.

Extensive additions in this edition include

A new chapter on cyclic redundancy checking (CRC), including routines for the commonly used CRC-32 code A new chapter on error correcting codes (ECC), including routines for the Hamming code More coverage of integer division by constants, including methods using only shifts and adds Computing remainders without computing a quotient More coverage of population count and counting leading zeros Array population count New algorithms for compress and expand An LRU algorithm Floating-point to/from integer conversions Approximate floating-point reciprocal square root routine A gallery of graphs of discrete functions Now with exercises and answers