9
Sep

# Sorting Algorithms – English

Computers often have to sort lists into order sometimes alphabetically by date or some other value usually computers can only compare two values at a time we’re going to simulate this by using balance scales to make the comparison each container is a different weight and you need to use the scales to compare them one approach to sorting them from lightest to heaviest is to find the heaviest one first this is done by comparing each container with the heaviest one so far after all the containers have been compared we have found the heaviest container we then do this again to select the heaviest from the remaining containers this builds up our sorted list one item at a time the list is finally sorted after 55 comparisons a faster way is to pick the container at random and split the collection into two groups those that are lighter on the left and the heavier ones on the right now all we need to do is sort the two groups we can do this by using the same method on each group pick a container at random and split its group into two parts the process continues in the same way any unsorted group is split into two groups until there’s only one container in a group a single container is already sorted this method might seem tricky but it only needed 27 comparisons that’s why it’s called quicksort for more information about the SEC tivity and the unplugged project visit our website at CES unplugged or you

Tags: , , , ,

• cao matrix says:

select sort

• Vitasims says:

now THAT is what I want to see!

• Dog In Yard says:

Indeed, very interesting!

• VictouffeVideos says:

the catch is : if you select the wrong random container, you will still have 55 comparisons,

• CAS TV says:

Great introduction. Added to our favourites playlist.

• Conor Gallagher says:

hello

• Barry Herron says:

hello

• callaghan mathew says:

great video would recommend to whole family of 12