search

DelNov / T-Flows

Program for Simulation of Turbulent Flows
Other
113 stars 50 forks source link

Replace existing sorting functions with new "heapsort" version wherever appropriate. #51

Closed Niceno closed 5 years ago

Niceno commented 6 years ago

Heapsort introduced by Egor seems to be doing a good job. It makes sense for all other routines (Sort_Int..., Sort_Short..., etc) to accept the same algorithm.

Niceno commented 6 years ago

Actually ... I did some measurements. Heapsort looks nice, but it is slower than quicksort. Let's wait with this for a moment.

Niceno commented 6 years ago

I am preparing a new module, Sort_Mod, which will contain all sorting functions. All are based on quicksort, since it is the fastest sorting algorithm.

Niceno commented 5 years ago

This is obsolete after the introduction of Sort_Mod