i want to print the double base representation of a number ie if my number is 38 i shud get 36 + 2 and for 655 i shud get 648 + 6 + 1. here's my...
i know it might sound stupid asking this but im stumped. how could i modify the binary search code so as to find an element in the array which is...
im writin this code to generate the powers of 2 n 3 ie (2^i)*(3^j) with i and j from 0 to 64 and since im using NTL i dont have to worry bout...
im writing a code where im multiplying 2 and 3 with their powers, ie (2 ^ i) * ( 3 ^ j )..n if the resultant sum is greater than 32 bits then im...
hi ppl! i would like to know how to use a binary search tree to find the optimal double base representation of a decimal number for eg with...
Separate names with a comma.