there are a million different ways to sort. Okay, we exaggerate. There are a few hundred. But as a programmer, you are expected to memorize them all. Each sorting algorithm has its own performance characteristics. In this sample, we’ve implemented a classic algorithm called “quicksort,” as well as a binary-search algorithm. We aren’t suggesting that either of these techniques will be the ultimate solution for your problems. But they can be a useful starting point.
KeywordsPerformance Characteristic Source Code Binary Search Actual Source Classic Algorithm
Unable to display preview. Download preview PDF.