This is from the book DATA STRUCTURES USING C AND C++ second edition by Langsam, Augenstein, and Tenenbaum:
1. Bubble Sort: least efficient.
x= array of integers
sorting 1 to n
pass through the file sequentially several times, comparing each element with its successor and interchanging if...