Flipped the resulring number

Author: Ankononenko

For loop/50. Decimal to octal.c

@@ -24,7 +24,7 @@ The Octal of 79 is 117.
 +    Function to count how many iterations of /8 there will be
 +    Power function
 +    Function to get the number int
-    Reverse it
++    Reverse it
 5. Output
 6. Test
 7. Cpplint test
@@ -37,25 +37,44 @@ int input_decimal_number();
 int number_of_eights(int decimal_number);
 int power(int base, int exponent);
 int convert(int decimal_number, int division_by_eight);
+int reverse_number(int converted_number, int division_by_eight);
 
 int main() {
     int decimal_number = input_decimal_number();
     int division_by_eight = number_of_eights(decimal_number);
     int converted = convert(decimal_number, division_by_eight);
+    int converted_and_flipped = reverse_number(converted, division_by_eight);
     printf("Division by eight = %d\n", division_by_eight);
-    printf("Converted but not flipped = %d", converted);
+    printf("Converted but not flipped = %d, flipped = %d\n", converted, converted_and_flipped);
     return 0;
 }
-// Conversion steps:
-//         1 Divide the number by 8.
-//         2 Get the integer quotient for the next iteration.
-//         3 Get the remainder for the octal digit.
-//         4 Repeat the steps until the quotient is equal to 0.
-//    79 % 8 == 7; quotient = 9
-//     9 % 8 == 1; q = 1
-//     1 % 8 == 1; q = 1
-// I will probably need a function to count how many iterations I will need to convert result into a number.
-// I'll need that function once again when I will flip the number
+
+// 711 -> 117
+
+int reverse_number(int converted_number, int division_by_eight) {
+    int result = 0, temp_converted = converted_number, digit, power_counter = division_by_eight - 1;
+    for (int i = 0; i <= division_by_eight; ++i) {
+        digit = temp_converted % 10;
+        temp_converted /= 10;
+        result += digit * power(10, power_counter);
+        --power_counter;
+    }
+    return result;
+}
+
+/*
+Conversion steps:
+        1 Divide the number by 8.
+        2 Get the integer quotient for the next iteration.
+        3 Get the remainder for the octal digit.
+        4 Repeat the steps until the quotient is equal to 0.
+   79 % 8 == 7; quotient = 9
+    9 % 8 == 1; q = 1
+    1 % 8 == 1; q = 1
+I will probably need a function to count how many iterations I will need to convert result into a number.
+I'll need that function once again when I will flip the number
+*/
+
 int convert(int decimal_number, int division_by_eight) {
     int result = 0, quotient, remainder, temp_decimal = decimal_number, divider = 8, power_counter = division_by_eight;
     for (int i = 0; i <= division_by_eight; ++i) {