This SEEMS to work, but I feel like i'm missing something.

VB Code:
  1. Private Sub SortCollection(ByRef collectionname As EntryCollection)
  2.         For i As Integer = 1 To collectionname.Count
  3.             For j As Integer = 2 To collectionname.Count
  4.                 If CType(collectionname(j), Entry).Filesize >= CType(collectionname(j - 1), Entry).Filesize Then
  5.                     collectionname.Swap(j, j - 1)
  6.                 End If
  7.             Next
  8.         Next
  9. End Sub

(and here is the swap function out of my EntryCollection Class)

VB Code:
  1. Public Sub Swap(ByVal FirstMember As Integer, ByVal SecondMember As Integer)
  2.             Dim temp As Object = List(FirstMember - 1)
  3.             List(FirstMember - 1) = List(SecondMember - 1)
  4.             List(SecondMember - 1) = temp
  5. End Sub

The type Entrycollection contains various enums and structures, the one being used in this case is the "Entry" type (which is where the Ctype statements come in)

Also, this seems like it would get REALLY slow with lots of members to sort, since it basically runs through the loop (number of members)^2 times.

Any other sorting methods that are faster, or theories in general?

Bill