// Metoda najszybszego spadku 20.12.2019


#include<iostream>


double grad(double x) {
	return (1 - (2 / (x * x * x)));
}

double f(double x) {
	return x + pow(x, -2);
}



void metodaNajszybszegoSpadku() {

	double lambda = 0.1;
	double x1 = 1.0;
	double x0 = 0.0;
	double epsilon = 0.0000001;
	int k = 0;

	do {
		k++;
		x0 = x1;
		x1 = x1 - lambda * grad(x1);

		//std::cout << "iteracja: " << k << ", x = "<<x1<<std::endl;


	} while (abs(x1 - x0) > epsilon);

	std::cout << std::endl;
	std::cout << std::endl;
	std::cout << "x = " << x1 << std::endl;
	std::cout << "Liczba iteracji = " << k << std::endl;
}

int main() {

	metodaNajszybszegoSpadku();

	system("pause");
	return 0;
}