If you are sorting content into an order, one of the most simple
techniques that exists is the bubble sort technique. In essence
you start at one end of the list, move one by one to the other
end of the list, and if you ever reach a situation where two
items are out of order, you swap them. This is one of the most
simple sort techniques that exists, that is taught in any basic
programming course. Let's say you have an array of Grades(5).
You want to sort them so that the highest grade is at the
beginning of the list, and that the lowest grade is at the end
of the list. Note that this is NOT REAL CODE. This is an example
of the concept, that you can apply to any language. So you would
fill Grades(5) with the values. Then you would say - for ctr = 1
to 4 .for ctr2 = ctr + 1 to 5 ..if Grades(ctr) < Grades(ctr2)
then ...Temp = Grades(ctr) ...Grades(ctr) = Grades(ctr2)
...Grades(ctr2) = Temp So in essence you have the outer loop
stepping through each item but the very last one. The inner loop
steps through every u