f-prime / f-prime/fist

Reimplement indexing algorithm

Open
#47 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
C
Stars
624
Forks
52
PR merge metrics
No merged PRs in 30d

Description

Indexing algorithm can (should) be able to be sped up by using a divide and conquer algorithm.

Contributor guide

No contributing guide indexed for this repository

Research direction

The issue does not name a file, test, or entry point. Start by locating the existing indexing algorithm and its tests, then determine how its current results and performance are measured. Done means the indexing behavior remains correct and the divide-and-conquer reimplementation provides the intended speed improvement.

Written by the indexing model from the issue text.

Assessment

Tech stack
c
Domain
performance, search
Issue type
Refactor
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.