eddieantonio / eddieantonio/ocreval

Faster algorithm possible?

Open
#13 1 comment 0 reactions 0 assignees View on GitHub
Dominant language
C
Stars
60
Forks
14
PR merge metrics
No merged PRs in 30d

Description

Would it be possible to get the algorithm run faster. Maybe at the program split the strings smaller during the run. Now it seems to slow down when the amount of data increases (>100000 words).

Contributor guide

No contributing guide indexed for this repository

Research direction

No file, test, or entry point is named. Begin by locating the algorithm and profiling it with more than 100,000 words; done means demonstrating faster runtime as the input grows.

Written by the indexing model from the issue text.

Assessment

Tech stack
c
Domain
performance
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
20/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.