Which is an example of an algorithm for sorting a list of numbers? a. Put the smallest number at the beginning of the list. Put the largest number at the end of the list. Put the remaining numbers in order.
b. Swap the first two numbers in the list. Repeat this process until the last number is reached.
c. Compare the first two numbers in the list. If the second number is larger than the first number, swap the two numbers. Repeat this process.
d. Compare the first two numbers in the list. If the first number is larger than the second number, swap the two numbers. Repeat with the second number and third number, and so on until the last number is reached. Repeat this process starting from the beginning of the list until no more numbers are swapped.