Revision as of 14:55, 3 April 2024 edit Citation bot (talk \| contribs) Bots 5,866,664 edits Altered title. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 \| #UCB_webform_linked 354/515 ← Previous edit		Revision as of 09:32, 1 October 2024 edit undo Sascha (talk \| contribs) 180 edits m →Time complexity: Stylistic simplification Next edit →
Line 20: === Time complexity === The painter's algorithm's time-complexity ~~is heavily dependent~~depends on the [[sorting algorithm]] used to order the polygons. Assuming ~~the use of the most~~an 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 ===

Painter's algorithm: Difference between revisions