Prepares the programmer to create sort programs and provides the basic for reading more formidable literature in the field.

A witty and thought-provoking collection of visual poems constructed from stacks of books. Delighting in the look and feel of books, conceptual artist Nina Katchadourian’s playful photographic series proves that books’ covers—or more specifically, their spines—can speak volumes. Over the past two decades, Katchadourian has perused libraries across the globe, selecting, stacking, and photographing groupings of two, three, four, or five books so that their titles can be read as sentences, creating whimsical narratives from the text found there. Thought-provoking, clever, and at times laugh-out-loud funny (one cluster of titles from the Akron Museum of Art’s research library consists of: Primitive Art /Just Imagine/Picasso/Raised by Wolves), Sorted Books is an enthralling collection of visual poems full of wry wit and bookish smarts. Praise for Sorted Books “Katchadourian’s project . . . takes on a weight beyond its initial novelty. It’s a love letter to books, book collecting and the act of reading.” —San Francisco Chronicle “As a longtime fan of [Katchadourian’s] long-running Sorted Books project I’m thrilled for the release of Sorted Books—a collection spanning nearly two decades of her witty and wise minimalist mediations on life by way of ingeniously arranged book spines. . . . In an era drowned in periodic death tolls for the future of the physical book, her project stands as a celebration of the spirit embedded in the magnificent materiality of the printed page.” —Brain Pickings “Katchadourian’s stacks possess an understated sophistication; they are true to the intimate nature of books and yet reveal their dramatic features and unexpected potential.” —Publishers Weekly

A revealing and surprising look at how classification systems can shape both worldviews and social interactions. What do a seventeenth-century mortality table (whose causes of death include "fainted in a bath," "frighted," and "itch"); the identification of South Africans during apartheid as European, Asian, colored, or black; and the separation of machine- from hand-washables have in common? All are examples of classification—the scaffolding of information infrastructures. In Sorting Things Out, Geoffrey C. Bowker and Susan Leigh Star explore the role of categories and standards in shaping the modern world. In a clear and lively style, they investigate a variety of classification systems, including the International Classification of Diseases, the Nursing Interventions Classification, race classification under apartheid in South Africa, and the classification of viruses and of tuberculosis. The authors emphasize the role of invisibility in the process by which classification orders human interaction. They examine how categories are made and kept invisible, and how people can change this invisibility when necessary. They also explore systems of classification as part of the built information environment. Much as an urban historian would review highway permits and zoning decisions to tell a city's story, the authors review archives of classification design to understand how decisions have been made. Sorting Things Out has a moral agenda, for each standard and category valorizes some point of view and silences another. Standards and classifications produce advantage or suffering. Jobs are made and lost; some regions benefit at the expense of others. How these choices are made and how we think about that process are at the moral and political core of this work. The book is an important empirical source for understanding the building of information infrastructures.

A cutting-edge look at the emerging distributional theory of sorting Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting. Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory: * Contains introductory material on complete and partial sorting * Explains insertion sort, quick sort, and merge sort, among other methods * Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code * Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques * Features a variety of end-of-chapter exercises

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs -- with just enough math to let you understand and analyze algorithm performance. With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate. With this book, you will: Solve a particular coding problem or improve on the performance of an existing solution Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use Get algorithmic solutions in C, C++, Java, and Ruby with implementation tips Learn the expected performance of an algorithm, and the conditions it needs to perform at its best Discover the impact that similar design decisions have on different algorithms Learn advanced data structures to improve the efficiency of algorithms With Algorithms in a Nutshell, you'll learn how to improve the performance of key algorithms essential for the success of your software applications.

Card sorting helps us understand how people think about content and categories. Armed with this knowledge, we can group information so that people can better find and understand it. In this book, Donna describes how to plan and run a card sort, then analyse the results and apply the outcomes to your project.