Sorting Algorithms

ISBN-13: 9783565161447 / Angielski / Miękka / 164 str.

Lucien Sina

Opis

Sorting is one of the fundamental tasks in computer science. This book offers a clear, hands-on introduction to both classical and modern sorting techniques - from insertion, merge, quick and heapsort to counting and radix sort, and on to hybrid and external methods. Alongside readable Java code and runtime analyses, the book centers on the practical question: which sorting algorithm is appropriate when? It demonstrates how sorting algorithms serve as central building blocks across many areas of computer science - for example in graph algorithms, database systems, and other applications. A compact, well-founded guide for study, teaching, and professional practice.

This book offers a clear, hands-on introduction to both classical and modern sorting techniques.