These algorithms are different by the productivity. "Neaerest neighbor" is the quickest, it uses only one point for resizing, whereas "Bilinear" – 4 points, "Bicubic" – 16 points; Lanczos also uses 16 points.
Depending on tasks, for speeding up resizing process you can chose appropriate algorithm. For example, in case of resizing to a very small size it’s advisable to use Lanczos, to a medium size – Bilinear would be enough.
Hann: It is similar to Lanczos algorithm with as little differences in realization.
Lanz8 is the most powerful resizing algorithm, but it is slower and uses 64 points.