mergesort

  1. Noun.  (computing) A divide and conquer sorting algorithm that operates by dividing the items to be sorted into many small lists and gradually merging them together.
  2. Verb.  (transitive) (computing) To sort with such an algorithm.

This is an unmodified, but possibly outdated, definition from Wiktionary and used here under the Creative Commons license. Wiktionary is a great resource. If you like it too, please donate to Wikimedia.

This entry was last updated on RefTopia from its source on 3/20/2012.