RJ786

[RFC]: implement a broader range of statistical distributions (tracking issue)

1

### Description This RFC proposes implement large number of probability distributions. The purpose of this issue is to serve as a tracking issue for implement large number of probability distributions....

Resolves #1640 . ## Description > What is the purpose of this pull request ## Related Issues > Does this pull request have any related issues? ## Questions > Any...

Resolves #1644 . ## Description > What is the purpose of this pull request? ## Related Issues > Does this pull request have any related issues? ## Questions > Any...

Resolves #1805 . ## Description > What is the purpose of this pull request? This pull request: - add C implementation for `@stdlib/math/base/assert/int32-is-even` ## Related Issues > Does this pull...

feat: `add pyds.maximum_subarray_sum_1`

2

This update introduces a brute force approach to finding the maximum subarray sum by iterating over all possible subarrays. It serves as an alternative to Kadane’s Algorithm, with a time...

- [x] A (A-Star) Algorithm: It efficiently finds the shortest path between a start node and a target node by combining aspects of Dijkstra’s Algorithm. Fixes #486

The Parallel Floyd-Warshall algorithm is an advanced computing technique used to find shortest paths in a weighted graph. It employs parallel processing methods to enhance computational efficiency, making it ideal...