Ruddy turnstone but it feeds mainly on invertebrates. Insects are particularly important in the breeding season. At other times it also takes crustaceans, molluscs and worms. It often flips over stones and other objects to get at prey items hiding underneath; this behaviour is the origin of the name "turnstone". It usually forages in flocks. They have also been observed preying on the eggs of other bird species such as gulls, terns, ducks, and even other turnstones, though this behaviour is uncommon. In the majority of observed cases, turnstones typically go after undefended or unattended nests, puncturing the shells with their beaks
Block sort Block sort Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at in-place stable sorting. It gets its name from the observation that merging two sorted lists, and , is equivalent to breaking into evenly sized "blocks", inserting each block into under special rules, and merging pairs. One practical algorithm for O(log n) in place merging was proposed by Pok-Son Kim and Arne Kutzner in 2008. The outer loop of block sort is identical to a bottom-up merge sort, where each "level" of the sort merges pairs