Fix compiling errors

Author: sentenza

src/main/scala/DynamicProgramming/CoinChange.scala

@@ -1,30 +1,28 @@
 package DynamicProgramming
 
-/**
-  * An implementation of famous dynamic programming Coin Change Problem
-  * Problem Statement: Given an amount and a list of coin change, find number of possible
-  * combinations to get the amount
+/** An implementation of famous dynamic programming Coin Change Problem Problem Statement: Given an amount and a
+  * list of coin change, find number of possible combinations to get the amount
   */
 
-
 object CoinChange {
 
-  /**
-    *
-    * @param coins   - a list of integers i.e. change coins
-    * @param money   - the target amount
-    * @return - number of combinations possible to get the amount
+  /** @param coins
+    *   - a list of integers i.e. change coins
+    * @param money
+    *   - the target amount
+    * @return
+    *   - number of combinations possible to get the amount
     */
 
   def coinChange(coins: List[Int], money: Int): Int = {
-    val combinations :Array[Int] = new Array[Int](money+1)
+    val combinations: Array[Int] = new Array[Int](money + 1)
 
     combinations(0) = 1
 
     for (coin <- coins) {
       for (i <- coin to money) {
         if (i >= coin) {
-          combinations(i) += combinations(i-coin)
+          combinations(i) += combinations(i - coin)
         }
       }
     }

src/main/scala/Mathematics/Abs.scala

@@ -2,16 +2,15 @@ package Mathematics
 
 object Abs {
 
-	/**
-	    * Method returns absolute value of the number
-	    *
-	    * @param Int
-    	    * @return
-    	*/
+  /** Method returns absolute value of the number
+    *
+    * @param Int
+    * @return
+    */
 
-	def abs(number : Int): Int = {
-	    if (number < 0)
-		return number * -1
-	    return number;
-	}
+  def abs(number: Int): Int = {
+    if (number < 0)
+      return number * -1
+    return number;
+  }
 }

src/main/scala/Mathematics/AbsMax.scala

@@ -2,8 +2,7 @@ package Mathematics
 
 object AbsMax {
 
-  /**
-    * Method returns absolute Maximum Element from the list
+  /** Method returns absolute Maximum Element from the list
     *
     * @param listOfElements
     * @return

src/main/scala/Mathematics/AbsMin.scala

@@ -2,8 +2,7 @@ package Mathematics
 
 object AbsMin {
 
-  /**
-    * Method returns Absolute minimum Element from the list
+  /** Method returns Absolute minimum Element from the list
     *
     * @param listOfElements
     * @return

src/main/scala/Mathematics/BinaryExponentiation.scala

@@ -1,11 +1,11 @@
 package Mathematics
 
 object BinaryExponentiation {
-  /**
-    * Method returns the binary exponentiation of a given number
-    * when base and power are passed the parameters
+
+  /** Method returns the binary exponentiation of a given number when base and power are passed the parameters
     *
-    * @param Int , Int
+    * @param Int
+    *   , Int
     * @return
     */
 
@@ -19,4 +19,4 @@ object BinaryExponentiation {
       return answer * answer
     }
   }
-} 
+}

src/main/scala/Mathematics/Fibonacci.scala

@@ -1,13 +1,13 @@
 package Mathematics
 
 object Fibonacci {
-  private val allFibonacci: Stream[Int] = 1 #:: 1 #:: allFibonacci.zip(allFibonacci.tail).map(t => t._1 + t._2)
+  private val allFibonacci: LazyList[Int] = 1 #:: 1 #:: allFibonacci.zip(allFibonacci.tail).map(t => t._1 + t._2)
 
-  /**
-    * Method to use the allFibonacci stream to take the first total numbers
-    * Using streams is both an easy and efficient way to generate fibonacci numbers (streams are memoized)
+  /** Method to use the allFibonacci stream to take the first total numbers Using streams is both an easy and
+    * efficient way to generate fibonacci numbers (streams are memoized)
     *
     * @param total
+    *   Maximum number of elements of the sequence
     * @return
     */
   def fibGenerate(total: Int): Seq[Int] = allFibonacci.take(total)

src/main/scala/Mathematics/FindMax.scala

@@ -2,8 +2,7 @@ package Mathematics
 
 object FindMax {
 
-  /**
-    * Method returns Max Element from the list
+  /** Method returns Max Element from the list
     *
     * @param listOfElements
     * @return

src/main/scala/Mathematics/FindMin.scala

@@ -2,8 +2,7 @@ package Mathematics
 
 object FindMin {
 
-  /**
-    * Method returns Minimum Element from the list
+  /** Method returns Minimum Element from the list
     *
     * @param listOfElements
     * @return

src/main/scala/Mathematics/GreaterCommonDivisor.scala

@@ -2,10 +2,10 @@ package Mathematics
 
 object GreaterCommonDivisor {
 
-  /**
-    * Method returns the Greatest Common Divisor of two numbers n, m
+  /** Method returns the Greatest Common Divisor of two numbers n, m
     *
-    * @param num1 , num2
+    * @param num1
+    *   , num2
     * @return
     */
 

src/main/scala/Mathematics/LinearSieve.scala

@@ -1,14 +1,14 @@
 package Mathematics
 
 object LinearSieve {
-  /**
-    * Method returns sequence of prime numbers which all are not greater than n
+
+  /** Method returns sequence of prime numbers which all are not greater than n
     *
     * @param n
     * @return
     */
   def getPrimeNumbers(n: Int): Seq[Int] = {
-    var primeNumbers = Seq.empty[Int]
+    var primeNumbers                   = Seq.empty[Int]
     val lowestPrimeDivisor: Array[Int] = Array.fill(n + 1)(0)
     for (i <- 2 to n) {
       if (lowestPrimeDivisor(i) == 0) {