averyhochheiser/Algorithms-and-Data-Structures---CountCollinear
View on GitHub ↗Related repositories →Counts sets of points that are collinear and lie on a non-horizontal line. Has a brute force and fast method, implements a sort algorithm and binary search. Prints how long the brute force method takes to run. Has input files for arrays of size 1k, 2k, 4k, and 5k. Comes with JUnit tests to test without the use of the stopwatch and input files.
active 2024-10-02 → 2024-10-02 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-10-02 to 2024-10-02. Pushes: 1 total, peak 1 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
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| averyhochheiser | 1 | 1 | 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 — 0 stars here means stars gained during the window, not the repo's star count.