Question d’entretien chez Bloomberg
Insert sort & complexity? binary tree & Depth First Search? reverse number?Classic questions.
Réponse à la question d'entretien
Utilisateur anonyme
5 avr. 2013
#include #include #include using namespace std; int main() { int num = 1234; int sum = 0; int rem; while(num){ rem = num%10; sum = sum*10+rem; num = num/10; } cout<