wmhtet wmhtet

View Ackermann.scala
1 2 3 4 5 6 7 8 9 10
/*
http://blog.aunndroid.com/2011/11/learning-scala-recursion-and-tco-1.html
 
Ackermann is being studied for recursion. It is quite complex to do TCO for Ackermann.
However, there have been some implementation of Ackermann in Haskell with TCO
http://lambda-the-ultimate.org/node/2673
*/
object Ackermann {
def main(args : Array[String]) : Unit = {
println(args.toList);
View RecursionEx.scala
1 2 3 4 5 6 7 8 9 10
/*
http://blog.aunndroid.com/2011/11/learning-scala-recursion-and-tco-1.html
This is the recursion example (p.97) used in "Programming Interviews Exposed"
by John Mongan, Noah Suojanen, Eric Giguère
 
The book's imperative style C# code (function combine) has been reimplemented in Scala.
Function recursionEx is in pure FP way.
Function tailReccursionEx is implemented to get TCO'ed (TCO=Tail Call Optimization)
 
Here is the problem statement:
View Telephone Words
1 2 3 4 5 6 7 8 9 10
/*
http://blog.aunndroid.com/2011/11/learning-scala-recursion-and-tco-1.html
This is the FP implementation of the "Telephone Words"
where the program accept 7 digit ph number and spit out
all possible word combination e.g. 464-7328 can be
"GMGPDAS ... IMGREAT ... IOIRFCU"
Per following table, where 1 and 0 does not represent any alphabet
------------
| |ABC|DEF|
View boyer_moore.scala
1 2 3 4 5 6 7 8 9 10
//http://blog.aunndroid.com/2011/11/learning-scala-boyermoore-search-1.html
object boyer_more {
def main(args : Array[String]) = {
if (args.length == 2 && args(0).length >= args(1).length) {
val result = boyer_more_search(args(0), args(1))
println("Match found : " + result.length +
" Pos : " + result.mkString(" "))
} else {
println
println("Usage: boyer_more string_body search_string")
View TicTacToe.scala
1 2 3 4 5 6 7 8 9 10
import io.Source
import scala.util.control.Breaks._
 
/**
* Scala TicTacToe game without any side effects
*
* http://blog.aunndroid.com/2011/11/chewy-code-scala-tictactoe-part-1.html
*/
object TicTacToe {
val WinCount = 3
Something went wrong with that request. Please try again.