Merge branch 'master' into master

Author: alirezasariri78

Algorithms.Tests/Numeric/FloorTests.cs

@@ -0,0 +1,27 @@
+using System;
+using System.Numerics;
+using Algorithms.Numeric;
+using NUnit.Framework;
+
+namespace Algorithms.Tests.Numeric;
+
+public static class FloorTests
+{
+    [TestCase(0.0, 0)]
+    [TestCase(1.1, 1)]
+    [TestCase(1.9, 1)]
+    [TestCase(1.0, 1)]
+    [TestCase(-1.1, -2)]
+    [TestCase(-1.9, -2)]
+    [TestCase(-1.0, -1)]
+    [TestCase(1000000000.1, 1000000000)]
+    [TestCase(1, 1)]
+    public static void GetsFloorVal<T>(T inputNum, T expected) where T : INumber<T>
+    {
+        // Act
+        var result = Floor.FloorVal(inputNum);
+
+        // Assert
+        Assert.That(result, Is.EqualTo(expected));
+    }
+}

Algorithms.Tests/Numeric/PerfectCubeTests.cs

@@ -0,0 +1,41 @@
+using Algorithms.Numeric;
+using NUnit.Framework;
+
+namespace Algorithms.Tests.Numeric;
+
+public static class PerfectCubeTests
+{
+    [TestCase(-27, ExpectedResult = true)]
+    [TestCase(27, ExpectedResult = true)]
+    [TestCase(4, ExpectedResult = false)]
+    [TestCase(64, ExpectedResult = true)]
+    [TestCase(0, ExpectedResult = true)]
+    [TestCase(1, ExpectedResult = true)]
+    [TestCase(8, ExpectedResult = true)]
+    [TestCase(9, ExpectedResult = false)]
+    public static bool IsPerfectCube_ResultIsCorrect(int number)
+    {
+        // Act
+        var result = PerfectCubeChecker.IsPerfectCube(number);
+
+        // Assert
+        return result;
+    }
+
+    [TestCase(-27, ExpectedResult = true)]
+    [TestCase(27, ExpectedResult = true)]
+    [TestCase(4, ExpectedResult = false)]
+    [TestCase(64, ExpectedResult = true)]
+    [TestCase(0, ExpectedResult = true)]
+    [TestCase(1, ExpectedResult = true)]
+    [TestCase(8, ExpectedResult = true)]
+    [TestCase(9, ExpectedResult = false)]
+    public static bool IsPerfectCubeBinarySearch_ResultIsCorrect(int number)
+    {
+        // Act
+        var result = PerfectCubeChecker.IsPerfectCubeBinarySearch(number);
+
+        // Assert
+        return result;
+    }
+}

Algorithms/Numeric/Floor.cs

@@ -0,0 +1,23 @@
+using System;
+using System.Numerics;
+
+namespace Algorithms.Numeric;
+
+/// <summary>
+///     Perform floor operation on a number.
+/// </summary>
+public static class Floor
+{
+    /// <summary>
+    ///    Returns the largest integer less than or equal to the number.
+    /// </summary>
+    /// <typeparam name="T">Type of number.</typeparam>
+    /// <param name="inputNum">Number to find the floor of.</param>
+    /// <returns>Floor value of the number.</returns>
+    public static T FloorVal<T>(T inputNum) where T : INumber<T>
+    {
+        T intPart = T.CreateChecked(Convert.ToInt32(inputNum));
+
+        return inputNum < intPart ? intPart - T.One : intPart;
+    }
+}

Algorithms/Numeric/PerfectCubeChecker.cs

@@ -0,0 +1,60 @@
+using System;
+
+namespace Algorithms.Numeric;
+
+/// <summary>
+///     A perfect cube is an element of algebraic structure that is equal to the cube of another element.
+/// </summary>
+public static class PerfectCubeChecker
+{
+    /// <summary>
+    ///     Checks if a number is a perfect cube or not.
+    /// </summary>
+    /// <param name="number">Number to check.</param>
+    /// <returns>True if is a perfect cube; False otherwise.</returns>
+    public static bool IsPerfectCube(int number)
+    {
+        if (number < 0)
+        {
+            number = -number;
+        }
+
+        var cubeRoot = Math.Round(Math.Pow(number, 1.0 / 3.0));
+        return Math.Abs(cubeRoot * cubeRoot * cubeRoot - number) < 1e-6;
+    }
+
+    /// <summary>
+    ///     Checks if a number is a perfect cube or not using binary search.
+    /// </summary>
+    /// <param name="number">Number to check.</param>
+    /// <returns>True if is a perfect cube; False otherwise.</returns>
+    public static bool IsPerfectCubeBinarySearch(int number)
+    {
+        if (number < 0)
+        {
+            number = -number;
+        }
+
+        int left = 0;
+        int right = number;
+        while (left <= right)
+        {
+            int mid = left + (right - left) / 2;
+            int midCubed = mid * mid * mid;
+            if (midCubed == number)
+            {
+                return true;
+            }
+            else if (midCubed < number)
+            {
+                left = mid + 1;
+            }
+            else
+            {
+                right = mid - 1;
+            }
+        }
+
+        return false;
+    }
+}

README.md

@@ -75,6 +75,7 @@ find more than one implementation for the same objective but using different alg
     * [Decomposition](./Algorithms/Numeric/Decomposition)
       * [LU Decomposition](./Algorithms/Numeric/Decomposition/LU.cs)
       * [Thin Singular Vector Decomposition](./Algorithms/Numeric/Decomposition/ThinSVD.cs)
+    * [Floor](./Algorithms/Floor.cs)
     * [Greatest Common Divisor](./Algorithms/Numeric/GreatestCommonDivisor)
       * [Euclidean GCD](./Algorithms/Numeric/GreatestCommonDivisor/EuclideanGreatestCommonDivisorFinder.cs)
       * [Binary GCD](./Algorithms/Numeric/GreatestCommonDivisor/BinaryGreatestCommonDivisorFinder.cs)
@@ -89,6 +90,7 @@ find more than one implementation for the same objective but using different alg
     * [Keith Number Checker](./Algorithms/Numeric/KeithNumberChecker.cs)
     * [Pseudo-Inverse](./Algorithms/Numeric/Pseudoinverse/PseudoInverse.cs)
     * [Narcissistic Number Checker](./Algorithms/Numeric/NarcissisticNumberChecker.cs)
+    * [Perfect Cube Checker](./Algorithms/Numeric/PerfectCubeChecker.cs)
     * [Perfect Number Checker](./Algorithms/Numeric/PerfectNumberChecker.cs)
     * [Perfect Square Checker](./Algorithms/Numeric/PerfectSquareChecker.cs)
     * [Euler Method](./Algorithms/Numeric/EulerMethod.cs)