Content deleted Content added
Line 151:
: {{re|Kri}} The merge algorithm takes two sorted chains (lists, sequences, arrays, ...) of data and creates a new chain (sometimes by copying the items of source data, sometimes by interleaving them, depending on the data structure in use), containing all items of both source chains in the proper order. Merge sort takes unsorted chain of data, decomposes it into multiple chains and successively merges them to construct a finał sorted chain of all source data. --[[User:CiaPan|CiaPan]] ([[User talk:CiaPan|talk]]) 20:14, 23 August 2023 (UTC)
::Yes. The merge algorithm is a subroutine in merge sort, not the whole merge sort. It is also used as a subroutine in some other algorithms unrelated to sorting. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 01:14, 24 August 2023 (UTC)
:::{{re|David Eppstein}} Thank you for clarification. {{smiley}} [[User:CiaPan|CiaPan]] ([[User talk:CiaPan|talk]]) 10:33, 29 August 2023 (UTC)
: {{re|Kri}} What David said about a ''𝄪subroutine𝄪'' above applies to words ''𝄪successively merges them𝄪'' in my answer. --[[User:CiaPan|CiaPan]] ([[User talk:CiaPan|talk]]) 10:33, 29 August 2023 (UTC)
| |||