Content deleted Content added
Are list comparison or equijoin "merge algorithms"? |
I intend to move equijoin and set differences form Merge_algorithm to Sorted_list_algorithms |
||
Line 9:
[[User:Pablo.cl|Pablo.cl]] 02:04, 24 May 2004 (UTC)
----
The only reference I've found so far that calls set difference a merge algorithm is [http://lists.canonical.org/pipermail/kragen-hacks/2004-March/000391.html Kragen Sitaker]. I think the nomenclature is misleading, and that the examples in italics above, and also the middle one I copy below, should be in a separate article, tentatively called [[Sorted list algorithms]].
I copy form kragen-hacks
<blockquote>
Some examples of merge algorithms:
*produce a single sorted list from multiple sorted lists. (This is the kind of merge used in mergesort.)
*produce the set union, set intersection, or set difference of two sorted lists. ''[Set intersection and set difference would be moved to [[Sorted list algorithms]].]''
*given a master file and an update file sorted in the same order, produce a new master file with all the updates applied.
</blockquote>
[[User:Pablo.cl|Pablo.cl]] 01:50, 26 May 2004 (UTC)
| |||