Sorting

Annual report of the State Department of Health of New York. 1894 pt.1

Sorting Data

The method of sorting is a flexible, easily-used (and enjoyable) technique well suited to exploring and mapping conceptual domains, to the study of subjective or folk-classifications, and to comparing existing classifications one with another. Originating in linguistics and psychology, sorting methods (also known as "own categories", and "pile-sorting") have diffused to a wide range of other social sciences. This book provides the first systematic introduction to the method of sorting and draws material from new and widely-scattered sources. It covers the collection and analysis of data, using free-sorting as the main focus, but includes other variants. Methods are provided for describing and comparing sortings, drawing on recent developments in partition theory and combinational analysis and for measuring their similarity. Appropriate methods are presented for the representation of both individual sortings and of the objects themselves: multidimensional scaling, correspondence analysis, and clustering techniques. Applications and available software are covered.

Sorting Algorithm Tutorials - Herong's Tutorial Examples

This book is a collection of notes and sample codes written by the author while he was learning sorting algorithms. Topics include introduction of sorting algorithms: Bubble Sort, Heap Sort, Insertion Sort, Merge Sort, Quicksort, Selection Sort, Shell Sort; Sorting algorithm implementations in Java, PHP, Perl and Python; Sorting algorithm performance comparison. Updated in 2024 (Version v6.12) with minor changes. For latest updates and free sample chapters, visit https://www.herongyang.com/Sort.