commit | 0db71e0fa94c1857f98890928098e8f4c8ac6f26 | [log] [tgz] |
---|---|---|
author | René Scharfe <rene.scharfe@lsrfire.ath.cx> | Sun Apr 01 00:10:11 2012 +0200 |
committer | Junio C Hamano <gitster@pobox.com> | Wed Apr 11 08:50:53 2012 -0700 |
tree | 0095038b4c0b0c9d643380f479cb17db1dcd14a6 | |
parent | 828ea97de486c1693d6e4f2c7347acb50235a85d [diff] |
add mergesort() for linked lists This adds a generic bottom-up mergesort implementation for singly linked lists. It was inspired by Simon Tatham's webpage on the topic[1], but not so much by his implementation -- for no good reason, really, just a case of NIH. [1] http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html Signed-off-by: Rene Scharfe <rene.scharfe@lsrfire.ath.cx> Signed-off-by: Junio C Hamano <gitster@pobox.com>