Triangle Fill by Edge Walking

Write a C program that fills a triangle using the scanline edge-walk algorithm.

Requirements:

• Define three vertices: (2, 2), (8, 3), (5, 8)
• Sort vertices by y-coordinate to identify top, middle, and bottom
• For each scanline from top_y to bottom_y:
  • Calculate the x-intersections of the scanline with the triangle's left and right edges
  • Use linear interpolation: for an edge from (x0, y0) to (x1, y1), x at scanline y is x0 + (y - y0) * (x1 - x0) / (y1 - y0)
  • Print each filled pixel as "(x, y)"
• Track and print the total number of interior pixels
• Handle the split at middle_y: above it, one pair of edges bounds the scanline; below it, a different pair does
• Print a bounding box summary: min/max x and y of the triangle
• Include a note explaining why triangles (not quads or polygons) are the standard rasterization primitive