improve docstring for DDA algorithm (#14029)

* improve docstring for DDA algorithm

Fixes #13905

Improves the DDA algorithm docstring by adding:
- explanation of how the algorithm works
- its main disadvantage
- comparison with Bresenham algorithm
- reference link for further reading

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* improve docstring for DDA algorithm

Fixes #13905

Improves the DDA algorithm docstring by adding:
- explanation of how the algorithm works
- its main disadvantage
- comparison with Bresenham algorithm
- reference link for further reading

* Refactor docstring for digital_differential_analyzer_line

Updated the docstring to clarify the DDA algorithm description and removed redundant references.

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>

Author: 3 people

graphics/digital_differential_analyzer_line.py

@@ -1,17 +1,31 @@
+# https://en.wikipedia.org/wiki/Digital_differential_analyzer_(graphics_algorithm)
+
 import matplotlib.pyplot as plt
 
 
 def digital_differential_analyzer_line(
     p1: tuple[int, int], p2: tuple[int, int]
 ) -> list[tuple[int, int]]:
     """
-    Draws a line between two points using the DDA algorithm.
+    Digital Differential Analyzer (DDA) Line Drawing Algorithm.
+
+    Draw a straight line between two points by calculating the difference in
+    x (dx) and y (dy) coordinates and incrementally stepping through the
+    dominant axis while updating the other axis using fractional increments.
+
+    One of the main disadvantages of the DDA algorithm is its reliance on
+    floating-point arithmetic, which can introduce rounding errors at each step.
+    Because of this, it is generally slower and less accurate than the
+    Bresenham line drawing algorithm, which uses only integer arithmetic.
+
+    Despite this, DDA is useful for educational purposes as it is simple
+    to understand and demonstrates the basic idea of incremental line generation.
 
     Args:
-    - p1: Coordinates of the starting point.
-    - p2: Coordinates of the ending point.
+      - p1: Coordinates of the starting point.
+      - p2: Coordinates of the ending point.
     Returns:
-    - List of coordinate points that form the line.
+      - List of coordinate points that form the line.
 
     >>> digital_differential_analyzer_line((1, 1), (4, 4))
     [(2, 2), (3, 3), (4, 4)]