

List of tasks to complete

• Tasks for algorithms module
  • Tasks for Fibonacci
    • Create test cases and check for the correctness of the algorithm. GetNthFibonacciRecursive
    • Create test cases and check for the correctness of the algorithm. GetNthFibonacciIterative
  • Tasks for Factorization
    • Create test cases and check for the correctness of the algorithm. NaiveGCD
    • Create test cases and check for the correctness of the algorithm. EuclideanGCDRecursive
    • Create test cases and check for the correctness of the algorithm. EuclideanGCDIterative
    • Create test cases and check for the correctness of the algorithm. LCM
    • Create test cases and check for the correctness of the algorithm. PrimeFactorization
    • Create test cases and check for the correctness of the algorithm.IsPrimeNaive
    • Create test cases and check for the correctness of the algorithm.IsPrime
    • Complete the implementation of the function SieveOfEratosthenes