Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Newtons method
//gcc 5.4.0 #include <stdio.h> //Abdelghani Bellaachia, CSCI 1121 Page: 22 int main(void) { int i; double a=2; double x=1; double y; double y1; double final; do{ y=(x*x*x*x*x)-x-3; y1=5*(x*x*x*x)-1; final= x-(y/y1); ++i; printf("x%d=%lf\n",i,final); x=final; }while(i<a); }
run
|
edit
|
history
|
help
0
arrays vowles printing
Finding the second largets value v0.6
Tree
Why &(a+1) is not allowed
fibonacci2
linear hybrid cellular automaton reversible random bit generator stream cipher
20171103_Digitos
print_odd_pointer.c
swipe the numbers in cyclic way
AVANCE PREGUNTA 10 DE CADENAS