22 November 2010 One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort . It was described in 1990 in a 3-page paper by B.K. Haddon , and has become a firm favourite of mine. Cyclesort has some nice properties - for certain restricted types of data it can do a stable, in-place sort in linear time, while guaranteeing that each element will be moved at most once.
Read full article from cortesi - Cyclesort - a curious little sorting algorithm
No comments:
Post a Comment