fringewidth / fringewidth/jfit

Support for O(n^k) algorithms.

Open
#2 0 comments 0 reactions 0 assignees View on GitHub
enhancement good first issue
Dominant language
Java
Stars
2
Forks
0
PR merge metrics
No merged PRs in 30d

Description

jFit currently supports quadratic time $O(n^2)$ algorithms only. This issue proposes extending support to cubic, quartic, and potentially all 1D array algorithms in class $P$.

Contributor guide

No contributing guide indexed for this repository

Research direction

Start by reviewing how jFit currently represents and plots quadratic O(n^2) algorithms. Determine the intended scope for cubic, quartic, and broader 1D polynomial-time algorithms, then define completion against that scope; the issue names no files or tests.

Written by the indexing model from the issue text.

Assessment

Tech stack
java
Domain
tooling
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.