Exercism c++ problem

Projects Programming
19

The naive approach won't fly in your interview for that job you really want. It shows you been nowhere and haven't read beyond the end of your nose.

Courtesy of Claude. Extra points for spotting the BS items:

  1. Naive Method
  2. Recursion
  3. Kernighan’s Algorithm
  4. Looping Over Only Set Bits
  5. Table Lookup for Nibbles
  6. 128-entry Table for Byte Lookup
  7. Lookup Table
  8. GCC Built-in Function
  9. Divide-and-Conquer (Parallel Bit Count / HAKMEM Algorithm)
  10. SWAR (SIMD Within A Register)
  11. MIT HAKMEM Popcount
  12. Kernighan with Loop Unrolling
  13. AVX / SSE Intrinsics
  14. Parallel Algorithm with Carry-Save Adders
  15. Hardware Instruction Access (e.g. POPCNT)
  16. Recursive Bit Pairing
  17. Bit Manipulation with Floating Point Hack

a7