Content deleted Content added
GreenC bot (talk | contribs) Reformat 1 archive link. Wayback Medic 2.5 |
m link sorting algorithm using Find link |
||
Line 17:
=== Time complexity ===
The painter's algorithm's time-complexity is heavily dependent on the [[sorting algorithm]] used to order the polygons. Assuming the use of the most optimal sorting algorithm, painter's algorithm has a worst-case complexity of ''[[Big O notation|O]]''(''n'' log ''n + m*n''), where ''n'' is the number of polygons and ''m'' is the number of pixels to be filled.
=== Space complexity ===
| |||