Class FibonacciAlgorithmTest

java.lang.Object
topics.parallel.fibonacci.FibonacciAlgorithmTest

class FibonacciAlgorithmTest extends Object

Validation Suite for Naive Fibonacci

Demonstrates both the functional accuracy and the severe performance degradation of an O(2^N) algorithm. Benchmarking utilizes modern Java Time API.

Author:
vicegd
  • Constructor Details

    • FibonacciAlgorithmTest

      FibonacciAlgorithmTest()
  • Method Details

    • setup

      @BeforeAll static void setup()
      Initializes the context prior to executing validations.
    • teardown

      @AfterAll static void teardown()
      Cleans up resources after validations complete.
    • shouldComputeFibonacciForModerateSize

      @Test void shouldComputeFibonacciForModerateSize()

      Scenario: Computes Fibonacci for N=30.

      Purpose: Executes in a reasonable timeframe (milliseconds) to serve as a fast functional verification.

    • shouldComputeFibonacciForLargeSizeAndDemonstrateBottleneck

      @Test void shouldComputeFibonacciForLargeSizeAndDemonstrateBottleneck()

      Scenario: Computes Fibonacci for N=50.

      Purpose: Demonstrates the severe bottleneck of exponential complexity. Warning: This test will block the CPU for a significant duration on a single thread. In an automated CI/CD environment, consider adding @Disabled to prevent pipeline freezing.