Although not very performant, Bubble Sort, Selection Sort, and Insertion Sort are all simple algorithms for sorting a one-dimensional array. Each works well enough for shorter arrays.

In theory, it cannot be ruled out that the algorithms might run for longer than the age of the universe. But in practice, many algorithms seem to work just fine. Almost always.

T H Cormen, C E Leiserson & R L Rivest, Introduction to Algorithms, MIT Press 1990 (or 2nd edn, 2001 or 3rd edn, 2009); J R Hubbard, Programming with Java, Schaum's outlines, McGraw-Hill, 2nd edn, ...

In this survey paper we discuss the development of the simple assembly line balancing problem (SALBP); modifications and generalizations over time; present alternate 0-1 programming formulations and a ...

A simple, fast and effective heuristic for the Simple Assembly Line Balancing Type I problem (minimizing the number of workstations) is proposed. A fast and effective branch-and-bound algorithm, which ...

Data structures and algorithms in Java, Part 2 introduced a variety of techniques for searching and sorting one-dimensional arrays, which are the simplest arrays. In this tutorial you’ll explore ...