Home > Articles > Programming > Algorithms
Sort by Date | Title
- Algorithms: String Sorts
- Mar 20, 2014
- For many sorting applications, the keys that define the order are strings. In this section from Algorithms, Part II, the authors look at methods that take advantage of special properties of strings to develop sorts for string keys that are more efficient than general-purpose sorts.
- Algorithms: The Basic Programming Model
- Mar 13, 2014
- The authors of Algorithms, Part I describe a complete programming model using the Java programming language.
- Introduction to the Analysis of Algorithms
- Feb 7, 2013
- This chapter provides perspective on various approaches to studying algorithms, places the field of study into context among related fields, and sets the stage for the rest of the book. To this end, the authors illustrate concepts within a fundamental and representative problem domain: the study of sorting algorithms.
- Elements of Programming: Transformations and Their Orbits
- Jun 18, 2009
- The application of the deductive method to your programs assures that your system’s software components will work together and behave as they must. In this chapter, the authors discuss transformations and their orbits.
- Engineering Reliable Digital Interfaces
- Nov 21, 2007
- Learn quantitative techniques for making better decisions about digital interface design.
- Shortest Paths Graph Algorithms
- Mar 5, 2004
- Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. This chapter, about shortest-paths algorithms, explains a simple operation known as relaxation
- Simple Sorting in Java
- Apr 18, 2003
- Should you be comparing, swapping, or bubbling your data? Learn the basics of bubble, selection, and insertion sorts and figure out which one is the best for you.