Revision as of 21:41, 24 January 2022 (view source) Peak (talk \| contribs) (→‎{{header\|jq}}) ← Older edit		Revision as of 21:43, 24 January 2022 (view source) Peak (talk \| contribs) m (tidy) Newer edit →
Line 1: {{task\|Knuth's power tree}} (Knuth's power tree is used for computing   <big><big>x<sup>n</sup></big></big>   efficiently ~~using Knuth's power tree~~.) <br> Line 11: Then, using those integers, calculate and show the exact ~~(not approximate) value~~values of (at least) the integer powers below: ::*   <big>2<sup>n</sup></big>     where   n   ranges from   0 ──► 17   (inclusive) <br> Line 20: A  ''zero''  power is often handled separately as a special case. Optionally, support negative ~~integers~~integer ~~  (for the power)~~powers.

Knuth's power tree (view source)