How can you make a turbo c program by using one for loop to sort 3 numbers in ascending order?

Answer 1

Use the insertion sort algorithm.

Insertion sort works on the premise that a set of 1 can always be regarded as a sorted set, thus in a set of n elements, we can divide the set in two, with a sorted set at the beginning (with 1 element) and an unsorted set at the end (with all other elements). We then take the first element of the unsorted set and insert it into the sorted set, repeating until the unsorted set is empty.

We take the first element out of the unsorted set by copying it to a temporary variable, thus creating a gap in its place. We then examine the element to the left of the gap and, if the value is greater than the temporary, we copy it into the gap, effectively moving the gap one place to the left. We stop moving the gap when we reach the start of the array or the element to the left of the gap is not greater than the temporary. We then copy the temporary into the gap, increasing the sorted set by one element and reducing the unsorted set by one element.

We can implement this algorithm using just one for loop:

void sort (int* a, unsigned s) { // assume a refers to an array of length s

for (int i=2; i<s; ++i) {

int t = a[i]; // temporarily store a[i] outside the array

int g = i; // index g is the "gap" in the array

while (0<g && t<a[g-1]) { a[g]=a[g-1]; --g; } // move the gap to the correct insertion point

a[g] = t; // insert the temporary

}

}

Thus, to sort 3 numbers:

int a[3] = {2, 3, 1}; // unsorted

sort (a, 3);

assert (a[0]==1);

assert (a[1]==2);

assert (a[2]==3);

Answer 2

Store the values in an array and perform an insertion sort.