fragglet/c-algorithms

A library of common data structures and algorithms written in C.

View on GitHub ↗Jump to charts ↓

Summary Information

Updated 25 minutes ago
Type:Library / SDKCategory(s):Core & Utility LibrariesLanguages & Runtimes
Added to GitGenius on September 19th, 2026
Created on June 23rd, 2010
Open Issues & Pull Requests: 10 (+0)
GitHub issues: Enabled
Number of forks: 746
Total Stargazers: 3,615 (+0)
Total Subscribers: 189 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 755.0 days
Mean response time: 823.0 days
90th percentile: 1388.1 days
Tracked items: 3

Most active contributors

Sign in to see contributor activity.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 1
New in 7 days: 0
Closed in 7 days: 0
Avg open age: 640 days
Stale 30+ days: 1
Stale 90+ days: 1

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

No issue events were indexed in the last 7 days.

Detailed Description

C Algorithms is a library of common data structures and algorithms written in C.

The C standard library provides minimal functionality compared to other modern languages, leaving developers to implement or source common data structures and algorithms themselves. This project addresses that gap by offering a collection of well-established computer science implementations in C. The library is designed for flexibility: each module consists of a pair of C source and header files that can be copied directly into a project without external dependencies, or the entire collection can be built and linked as a library called libcalg.

The tool suits C projects that need standard data structures and algorithms but want to avoid heavyweight external dependencies or the complexity of integrating multiple libraries. It works well for embedded systems, performance-critical applications, or situations where keeping the codebase self-contained is important. The modular structure means you can adopt only what you need, making it practical for projects with strict size or dependency constraints.

The project maintains a stable codebase with occasional updates and fixes applied to the existing module collection. Development activity is measured and deliberate rather than rapid, reflecting the mature nature of the implementations. The maintainer responds to issues and accepts contributions, though the pace of change is conservative, which aligns with the project's role as a reference implementation of standard algorithms rather than an experimental or cutting-edge resource.