Skip to content

mahran80/DataStructTask1

View on GitHub ↗Related repositories →

The code simulates the DDA algorithm for line drawing in Java, taking user input for two endpoints. It calculates the slope, determines the maximum difference, and iteratively updates coordinates to print the line's points.

active 2024-05-25 → 2024-05-25 (UTC)

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

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-05-25 to 2024-05-25. Pushes: 2 total, peak 2 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
mahran802200

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.