// output of ./demo/arith/power-costs-demo.cc:
// Description:
//% Cost of binary exponentiation algorithm for full-precision numbers.

arg 1: 40 == n  [List costs for exponents up to n]  default=40
   e   bin(e)   #S   #M     #F    #C
   1   .....1    0    0      0       
   2   ....1.    1    0      2       
   3   ....11    1    1      5       
   4   ...1..    2    0      4       
   5   ...1.1    2    1      7       
   6   ...11.    2    1      7       
   7   ...111    2    2     10      9
   8   ..1...    3    0      6       
   9   ..1..1    3    1      9       
  10   ..1.1.    3    1      9       
  11   ..1.11    3    2     12     11
  12   ..11..    3    1      9       
  13   ..11.1    3    2     12     11
  14   ..111.    3    2     12     11
  15   ..1111    3    3     15     13
  16   .1....    4    0      8       
  17   .1...1    4    1     11       
  18   .1..1.    4    1     11       
  19   .1..11    4    2     14     13
  20   .1.1..    4    1     11       
  21   .1.1.1    4    2     14     13
  22   .1.11.    4    2     14     13
  23   .1.111    4    3     17     15
  24   .11...    4    1     11       
  25   .11..1    4    2     14     13
  26   .11.1.    4    2     14     13
  27   .11.11    4    3     17     15
  28   .111..    4    2     14     13
  29   .111.1    4    3     17     15
  30   .1111.    4    3     17     15
  31   .11111    4    4     20     17
  32   1.....    5    0     10       
  33   1....1    5    1     13       
  34   1...1.    5    1     13       
  35   1...11    5    2     16     15
  36   1..1..    5    1     13       
  37   1..1.1    5    2     16     15
  38   1..11.    5    2     16     15
  39   1..111    5    3     19     17
  40   1.1...    5    1     13