An optimized compression algorithm (I)

 
This is a compression algorithm code discussed in the CSDN Forum.
Compared with WinRAR,
255M files
Level = 0, 24.98 seconds, 95.1 M
Level = 255, 30.24 seconds, 91.6 M
The shortest size of WinRAR ZIP compression is 25.2 seconds and 58.6 MB.
Standard RAR compression. I checked it. It was too slow and I didn't try it. It may take several minutes for the result to come.
In terms of speed, the algorithm is basically flat. Although its maximum compression capacity is limited, it feels very well designed. Every time it is based on dynamic tables, the software can be very small, resource usage is also small. Worthy of favorites!
'Test the code in the form.
Option Explicit
Private WithEvents ObjZip As ClassZip
Private BgTime As Single
Private Sub commandementclick ()
BgTime = Timer
Command1.Enabled = False
Command2.Enabled = False
With ObjZip
. InputFileName = Text1.Text
. OutputFileName = Text2.Text
. IsCompress = True
. CompressLevel = Val (Text4.Text)
. BeginProcss
End
Label1.Caption = Round (Timer-BgTime, 2) & "seconds"
Command1.Enabled = True
Command2.Enabled = True
End Sub
Private Sub Command2_Click ()
BgTime = Timer
Command1.Enabled = False
Command2.Enabled = False