you are viewing a single comment's thread
view the rest of the comments
[–] 23 points 1 year ago* (1 child)

The program goes through the collection of numbers and prints each one after a delay of milliseconds equal to that number: "Print the number 20 after a 20 millisecond delay. Print the number 5 after a 5 millisecond delay. Print the number 100 after a 100 millisecond delay... etc..." effectively sorting the collection because the numbers will be printed in order from smallest to largest.

This is a clever (but impractical) way to sort a collection, because it does not require comparing any of the elements of the collection.

  • source
  • parent
  • hideshow 1 child comment
  • [–] 1 point 1 year ago

    because it does not require comparing any of the elements of the collection

    Well, if you are comparing x + a to y and x + b to y and then both to y', then y'' and so on, then are you really not comparing a to b?

  • source
  • parent