object Zadanie1a {
  def fibb(n: Int) : (Int) = {
    if(n==0 || n == 1)
      return n;
    else
      return(fibb(n-1) + fibb(n-2));
  }
  def main(args: Array[String]){
    println("Ciag fibbonaciego: " + fibb(37));
  }
}

object Zadanie1b{
  def fibb(n: Int) : Int = {
    if (n == 0 || n == 1)
      return n;
    def tfibb(n: Int, acc: Int, b: Int) : Int = {
      if(n == 0)
         return acc;
      else
         return tfibb(n-1, b, acc+b);
    }
    return tfibb(n, 0, 1);

    }
     def main(args: Array[String]){
    println("Ciag fibbonaciego: " + fibb(37));
  }
}


import scala.math;

object Zadanie2{
    def root3(a: Double, e: Double) : Double = {
        def troot3(a: Double, e : Double, acc: Double, c: Double) : Double = {
            if(math.abs(math.pow(acc,3)- a) <= math.abs(e*math.abs(a)))
              return acc;
            else{
              var res = acc + ((a/math.pow(acc,2)) - acc)/3;
              troot3(a,e,c,res);
            }
        }
        if(a < 1)
          return troot3(a, e, a, 0.0);
        else{
            return troot3(a,e, a/3,0.0);
        }
    }

    def main(args: Array[String]){
    println("Zaokraglenie: " + root3(25.43, 0.0000000000001));
  }
}

// a)
// val xs = List(-2, -1, 0 , 1, 2)
// val List(x2,x1,x,x3,x4) = xs

//b)
// val xs = List((1,2),(0,2))
// val List((z,y),(x,g)) = xs

object Zadanie4 {
    def segement(L2: List[Int], L3: List[Int]) = (L2, L3) match {
      case (head2 :: head3, head2_2 :: head3_2) => true
      case _ => false
       }
    def main(args: Array[String]){
    println("Ciag fibbonaciego: " + segement(List(1,3,4,5,6), List(2,3,4,5,6,7)));
  }

}
object Zadanie5 {
    def comp(e1: Int, e2: Int) = e1 < (e2);

    def merge (L1:List[Int], L2:List[Int]) : List[Int] = {
      return (L1.sortWith(comp)++L2.sortWith(comp)).sortWith(comp)

    }
    def main(args: Array[String]){
    println("Merge : " + merge(List(1,2,3,4,5), List(0,4,5,6,7,8)));
  }
}
object Zadanie6 {
    sealed trait BT[+A];
    case object Empty extends BT[Nothing]

    case class Node[+A]( elem:A , left:BT [A], right:BT [A]) extends BT[A]

    val t = Node (1,Node(2,Empty,Node(3,Empty,Empty)), Empty );

    def ifexist[A](bt:BT[A], i : Int) : Boolean = bt match {
      case Empty => return false;
      case Node(t.elem, tl, tr) (if t.elem != i) => ifexist(tl, i);
      case Node (i, _, _) => return true;
    }



    def main(args: Array[String]){
    println(ifexist(t, 8));
  }

}