In computer science, the term sorting usually refers to putting a list into alphabetical or numeric order. Match the following sorting terms with the definition. First find the lightest weight in the set and put it to one side. Next, find the lightest of the weights that are left, and remove it. Re-peat this until all the weights have been removed

Choose an item from the list and compare every other item in the list.
Place all the items that are greater than it into one subgroup and all the items that are smaller into another subgroup. Place the pivot item in between these two subgroups.
Choose a subgroup and repeat this process. Eventually each subgroup will contain only one item and at this stage the items will be in sorted order.

Works by removing each object from an unsorted group and inserting it into its correct position in a grow-ing list. With each inser-tion the group of unsorted objects shrinks and the sorted list grows, until eventually the whole list is sorted. Card players often use this method to sort a hand into order.