(computing theory) A sorting algorithm that divides the input list into two sublists — items already sorted, and items not yet sorted — and gradually transfers elements from one list to the other.

Obsolete spelling of Grecian Alternative form of Græcian

plural of pedder

(Botswana) San, Bushman