Talk:Algorithm: Difference between revisions
Jump to navigation
Jump to search
imported>Pat Palmer (article needs extensive work) |
imported>Pat Palmer (→Note to self: future idea to be added to this article) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
= Note to self = | = 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.[[User:Pat Palmer|Pat Palmer]] ([[User talk:Pat Palmer|talk]]) 14:43, 8 August 2020 (UTC) | 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.[[User:Pat Palmer|Pat Palmer]] ([[User talk:Pat Palmer|talk]]) 14:43, 8 August 2020 (UTC) | ||
:Maybe we could add this illustration at some point: <span class="newtab">[https://commons.wikimedia.org/wiki/File:Mergesort_algorithm_diagram.png Mergesort]</span> [[User:Pat Palmer|Pat Palmer]] ([[User talk: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.[[User:Pat Palmer|Pat Palmer]] ([[User talk:Pat Palmer|talk]]) 22:46, 13 February 2021 (UTC) | |||
Latest revision as of 16:46, 13 February 2021
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)