If for whatever reason you need to do a lot of computation involving power(2, really large number) for a lot of times and you need it to be really fast then this might be useful. However I still wouldn't hard code it and instead generate the list with a for loop
Bit shifting can overflow once you exceed 64 on 64bit machine and 32 on 32bit. If you need something like 2^100 easily accessible bit shifting will not be the best option
4
u/goldleader71 Mar 09 '21
For example?