Author: Gilberto Rogel García

WSQ06 – Greatest Common Divisor

--Originally published at GilbertoRogel

For this WSQ i had to find the greatest common divisor of two numbers using Euclid's algorithm.

WSQ06 – Greatest Common Divisor

I had no idea what Euclid's algorithm was so I did a little research and found this useful video that helped me make the code: Click to watch

Link to the code: Code

At first i had some trouble developing this code so, as you can see, i put a lot of SOP's (System.out.println) in between lines to check better what was going on and after about half an hour i realized what I was missing in my code.

 

 

Gilberto Rogel García - a01630171

#WSQ05 FINAL PROJECT-Entry1

--Originally published at GilbertoRogel

I'll be working on my final project with Oscar Lopez, Itzel Cordero and Luis Eduardo Vargas.

#WSQ05 FINAL PROJECT-Entry1

We were thinking about making some sort of Arcade which has, mainly, 2 videogames: a Tic-Tac-Toe and a Hangman. If we are able to implement these 2 videogames withouth trouble, we will try and add one or two more games (Ping-Pong) but we will focus on Hangman and Tic-Tac-Toe.

 

Gilberto Rogel García A01630171