Recursive exercises give any floating point number, and find the smallest integer that converts the fractional part into an integer.

Recursive exercises give any floating point number, and find the smallest integer that converts the fractional part into an integer.

/*************************************** **************************************** ** Copyright (C ), 1988-1999, drvivermonkey. co ., ltd. file name: Author: Driver Monkey Version: Mail: bookworepeng@hotmail.com qq: 196568501 Date: 2014.04.02 Description: recursive exercise given any floating point number, find the minimum integer ******************************* **************************************** * ********/# include <iostream> # include <sstream> # include <fstream> # include <iostream> # include <iomanip> # include <string> # include <memory. h> # include <thread> # include <stdlib. h> # include <math. h> using namespace std; static int fuction (double x, int guess, double pricision); int main () {double x = 1.5; double y = fuction (x, 2, 0.0001); cout <"fuction =" <y <endl; cout <"x * y =" <x * y <endl; return 0 ;} static int fuction (double x, int guess, double pricision) {double y = x * guess; double y_int_part = round (y ); // take the integer part double y_fractional_part = y-y_int_part; // take the fractional part if (fabs (y_fractional_part) <= pricision) {return guess;} int new_guess = guess + 2; // The minimum step for decimal digits to become an integer is 2 fuction (x, new_guess, pricision );}