WSQ13
here is my wsq, this page help me http://www.okomestudio.net/cs4bum/?p=76
and here is my wsqhttps://github.com/juanheuforico/WSQ/blob/master/WSQ13.py
-
Recent Posts
Recent Comments
Archives
Categories
Meta
WSQ13
here is my wsq, this page help me http://www.okomestudio.net/cs4bum/?p=76
and here is my wsqhttps://github.com/juanheuforico/WSQ/blob/master/WSQ13.py
WSQ13
here is my wsq, this page help me http://www.okomestudio.net/cs4bum/?p=76
and here is my wsqhttps://github.com/juanheuforico/WSQ/blob/master/WSQ13.py
WSQ13
here is my wsq, this page help me http://www.okomestudio.net/cs4bum/?p=76
and here is my wsqhttps://github.com/juanheuforico/WSQ/blob/master/WSQ13.py
This #wsq13 wasn´t actually very difficult to write, the tricky part is how tu understand the babylonian method work, and didn´t got it by reading, i searched in google how to make it in c++ and i saw a lot of codes, this one is how i got to do it and it is shorter than most of them and pretty clear, that´s how i understand it.
Here´s my dropbox link cause my github doesn´t work on my laptop.
https:/
#WSQ13#TC1017
I had to research about the babylonian method, and about the function that would work with a square root, after that I checked some code of my classmates for detailes and it worked.
BM! Not that Difficult! #WSQ13
Here is my Github code: https:/
And the Screen Caption of the running program : #TC1017
Comments Off on WSQ13 Babylonian Method
Posted in Blogs, Syndicated, TC1017 Blogs
Hi guys!!! On this occasion i make a code that performs an ancient process of Babylonian to calculate the square root of a number according to the method they used , here I leave the link extplica you which is the mathematical porceso to perform this calculation and also you leave my code .
http:/
/ es.wikipedia.org/ wiki/ Matem%C3%A1tica_babil%C3%B3nica
Comments Off on Babylonian #WSQ13 #TC1014
Posted in Blogs, Syndicated, TC1014 Blogs
Tagged #TC1014, #WSQ13, Sin categoría
Hay que declarar la variable “z” que sea igual a “n” y que “y” sea 0. Poner un loop que se rompa cuando “z” sea igual a “y”. Se empezará que “y” no sea igual a “z” por el valor de “n”, pero cuando “z” realizara el método babilónico, “y” tomará el valor de “z” anterior y se repetirá el procedimiento hasta que “y” sea igual a “z”. Eso es lo que yo entendí de acuerdo al código aquí, no sé ustedes. El output sería esto:
Aquí el link en GitHub:
https://github.com/YeshuaAguilar02/PYTHON/blob/master/WSQ13
Comments Off on WSQ13 BABYLONIAN METHOD
Posted in Blogs, Syndicated, TC1014 Blogs
Hay que declarar la variable “z” que sea igual a “n” y que “y” sea 0. Poner un loop que se rompa cuando “z” sea igual a “y”. Se empezará que “y” no sea igual a “z” por el valor de “n”, pero cuando “z” realizara el método babilónico, “y” tomará el valor de “z” anterior y se repetirá el procedimiento hasta que “y” sea igual a “z”. Eso es lo que yo entendí de acuerdo al código aquí, no sé ustedes. El output sería esto:
Aquí el link en GitHub:
https://github.com/YeshuaAguilar02/PYTHON/blob/master/WSQ13
Comments Off on WSQ13 BABYLONIAN METHOD
Posted in Blogs, Syndicated, TC1014 Blogs