This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* WordProbability.java | |
* Created with IntelliJ IDEA. | |
* User: stev | |
* Date: 2/7/13 | |
*/ | |
import java.util.Arrays; | |
import java.util.Random; | |
import java.util.Scanner; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* WordProbability.java | |
* Created with IntelliJ IDEA. | |
* User: stev | |
* Date: 2/7/13 | |
*/ | |
import java.util.Arrays; | |
import java.util.Random; | |
import java.util.Scanner; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* GCD.java | |
* Steven Pajuelo | |
* spajuelo | |
* pa3 | |
* Make a GCD to find GCD for two integer types, which neither are negative or of another type. | |
*/ | |
import java.util.Scanner; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* GCD.java | |
* Steven Pajuelo | |
* spajuelo | |
* pa3 | |
* Make a GCD to find GCD for two integer types, which neither are negative or of another type. | |
*/ | |
import java.util.Scanner; |