https://github.com/finntec/wsq13.git

link to video that explains babylonian method:

link to my code:

https://github.com/cortesivan96/WSQs/blob/master/babylonian%20method%20(WSQ13)

//Babylonian Method
#include <iostream>
using namespace std;

float bab(int a){
float x=a;
float y=1;
int i=0;
while(i<20){
x=(x+y)/2;
y=a/x;
i=i+1;}
return x;}
int main(){
cout<<“Dame el número para sacarle su raíz cuadrada “<<endl;
int a;
cin>>a;
cout<<“La raíz cuadrada de “<<a<<” es “<<bab(a)<<endl;
return 0;}

https://github.com/DianaJU/Write/blob/master/baby.py

Here’s my code:

https://github.com/Dragv/wsq13/tree/master

https://github.com/FernyAlanis/wsq11-17/blob/master/WSQ13

Foto: https://flic.kr/p/sNh6BL

Este WSQ estuvo fácil, solo tuve que ver de que trataba el método  y lo pude hacer. Aqui esta el link de mi código:

https://github.com/BrayanGc/Codigos/blob/master/BaMe.cpp

float raiz (float a){
float x = a / 2;
for (int i=0; i <20; i++){
x = .5*(x+(a/x));
}
return x;
}

int main (){
float a, r;
cout << “Escribe un numero al que quieras sacarle su raiz cuadrada “;
cin >> a;
float s = raiz (a);
cout << “la raiz cuadrada de  ” << a << ” = “<< s << endl;
return 0;
}

This one was a bit hard but I research some information on the internet and I could make it.