Class RecursiveActionSquare

All Implemented Interfaces:
Serializable, Future<Void>

public class RecursiveActionSquare extends RecursiveAction

Parallel Array Squaring (Fork/Join)

Implements a parallel divide-and-conquer strategy using RecursiveAction to compute the square of each integer in a shared array in-place.

Complexity

  • Time Complexity: O(N) - Total work remains linear, but runtime is reduced structurally by a factor proportional to the active hardware core count.
  • Space Complexity: O(log N) - Stack depth of the thread pool corresponds directly to the binary decomposition height.
Author:
vicegd
See Also:
  • Constructor Details

    • RecursiveActionSquare

      public RecursiveActionSquare(int[] data, int start, int end)
      Initializes the parallel action for a targeted segment of the array.
      Parameters:
      data - The shared array to mutate in-place.
      start - The inclusive starting boundary index.
      end - The exclusive ending boundary index.
  • Method Details