Birst Sort Explained in VB.NET Tutorials

BIRST Sort Explained Bytewise Index Radix SorT Link to snippet:- BIRST Sort Improved It is made from three tables 1. The Byte Index The first is called the Byte Index and only contains 256 entries. Each entry is made up of two parts;- A pointer to the first node A pointer to the last node [code=vb] Private Structure ByteIndice Dim First As Long Dim Last As Long End Structure [/code] 2. Radix SorT The second part is the radix part and contains the same number of entries as there are entries in the input data. Each entry is made up of two parts;- A pointer to the location of the actual data A pointer to the next node, which also has the byte index radix. [code=vb] Private Structure PtrNextPtr Dim Ptr As Long Dim NextPtr As Long End Structure [/code] 3. Position Array The Third is used a temporary array to copy the data into during the final sort. Algorithm [attachmentid=7920] 1. Find the longest length string (m) in the list o...