summaryrefslogtreecommitdiff
path: root/t/t4013/diff.diff-tree_-c_--stat_master
diff options
context:
space:
mode:
authorLibravatar René Scharfe <rene.scharfe@lsrfire.ath.cx>2012-04-01 00:10:11 +0200
committerLibravatar Junio C Hamano <gitster@pobox.com>2012-04-11 08:50:53 -0700
commit0db71e0fa94c1857f98890928098e8f4c8ac6f26 (patch)
tree0095038b4c0b0c9d643380f479cb17db1dcd14a6 /t/t4013/diff.diff-tree_-c_--stat_master
parentGit 1.7.9 (diff)
downloadtgif-0db71e0fa94c1857f98890928098e8f4c8ac6f26.tar.xz
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>
Diffstat (limited to 't/t4013/diff.diff-tree_-c_--stat_master')
0 files changed, 0 insertions, 0 deletions