Skip to content

CalinaBorzan/Fundamental_Algorithms

View on GitHub ↗Related repositories →

This repository features implementations of fundamental algorithms in data structures and graph theory, covering sorting, searching, traversal, and optimization techniques. Each algorithm is optimized and analyzed using profiler.h to measure performance metrics like comparisons, assignments, and, in some cases, execution time.

active 2025-02-25 → 2025-02-25 (UTC)

Complete coverage28,106 / 28,106 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-10-29 (UTC)
Events
18
Pushes
16
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2025-02-25 to 2025-02-25. Pushes: 16 total, peak 16 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
CalinaBorzan161600

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.