Citable Version ^[?]

To learn how to update the categories for this article, see here. To update categories, edit the metadata template.

Definition: A sequence of steps used to solve a problem. [d] [e]

Checklist and Archives

Workgroup categories: Computers and Mathematics [Categories OK]
Talk Archive: none	English language variant: British English

Unused subpages
Unused subpages: - Works - Discography - Filmography - Catalogs - Timelines - Gallery - Audio - Video - Code - Tutorials - Student Level - Signed Articles - Function - Addendum - Debate Guide - Advanced - Recipes - Citable Version

Note to self

This article needs extensive cleanup and fleshing out. It's frankly confusing right now. I'm adding it to my to-do list, but maybe someone else will come along in the meantime and work on it. It is also written mainly from a Computers viewpoint instead of a math viewpoint.Pat Palmer (talk) 14:43, 8 August 2020 (UTC)

Maybe we could add this illustration at some point: Mergesort Pat Palmer (talk) 22:46, 13 February 2021 (UTC)

Possible caption: This is a graphic illustration of the merge sort algorithm, a method of sorting a list that progressively breaks the list into smaller lists (possibly computed in parallel), sorts those lists and then merges the smaller lists repeatedly until a final sorted list results.Pat Palmer (talk) 22:46, 13 February 2021 (UTC)

Talk:Algorithm

Note to self

Navigation menu

Talk:Algorithm

Note to self

Navigation menu

Search