Skip to content

michaelcsuf/335-Project_1

View on GitHub ↗Related repositories →

This Python-based tool implements and analyzes five fundamental sorting and search algorithms: Bubble Sort, Merge Sort, Quick Sort, Radix Sort, and Linear Search. It allows users to compare the performance of these algorithms in terms of time complexity across different input sizes.

active 2025-02-27 → 2025-02-28 (UTC)

Complete coverage27,721 / 27,721 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-10-13 (UTC)
Events
29
Pushes
25
Pull requests
3
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 2 days from 2025-02-27 to 2025-02-28. Pushes: 25 total, peak 17 in a day. Pull requests: 3 total, peak 2 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
michaelcsuf232120
olasores5410

Recent activity

Latest issues, pull requests and releases

  • Pull request#2olasores2025-02-28 07:36
  • Pull request#1michaelcsuf2025-02-27 07:51
  • Pull request#1michaelcsuf2025-02-27 07:51

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.