Shoppu
Shoppu asistent virtual de cumpărături
Hacker's Delight - Henry Warren
Produs

Hacker's Delight - Henry Warren

Brand: Henry Warren · Categorie: Computers · Actualizat: 02.06.2026 03:05

418,43 lei464,92 lei

Ai ajuns la un produs concret. Îți pot spune rapid dacă merită, ce avantaje are și ce alternative similare găsești mai ușor.

Pe scurt: \n \nThis 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…

  • Îți pot recomanda rapid produse similare sau alternative mai bune din aceeași zonă.
  • Dacă nu e exact ce cauți, putem restrânge imediat opțiunile în funcție de preț, utilizare sau stil.
  • Poți deschide oferta din magazin sau poți continua aici conversația pentru comparații și recomandări.

Detalii despre produs

\n \nThis 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.\n \n--Josh Bloch (Praise for the first edition)\n \nIn 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. \n\n \nExtensive additions in this edition include \n \n- A new chapter on cyclic redundancy checking (CRC), including routines for the commonly used CRC-32 code \n- A new chapter on error correcting codes (ECC), including routines for the Hamming code \n- More coverage of integer division by constants, including methods using only shifts and adds \n- Computing remainders without computing a quotient \n- More coverage of population count and counting leading zeros \n- Array population count \n- New algorithms for compress and expand \n- An LRU algorithm \n- Floating-point to/from integer conversions \n- Approximate floating-point reciprocal square root routine \n- A gallery of graphs of discrete functions \n- Now with exercises and answers

Produse similare pe care le poți explora

Poți scrie sau vorbi, dacă vocea este activată.