Implementing sorting algorithms using inversion operations, aiming to minimize the number of inversions required for sorting any given array using search methods, including depth-first, breadth-first, random, and A* with custom heuristics, are employed to efficiently solve the inversion-based sorting problem
active 2024-04-15 → 2024-05-03 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 19 days from 2024-04-15 to 2024-05-03. Pushes: 8 total, peak 8 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: 2 total, peak 1 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
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Cizr | 8 | 8 | 0 | 0 |
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 — 2 stars here means stars gained during the window, not the repo's star count.