Search Results for "sorting algorithm"

Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this.

headsort sorts files by line and fields. Options can pick field order and etc. In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done. ...

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. ...

Sorting algorithm performance testing using a generic test interface

This is an academic project. A library and a sample program will be developed, that will implement the Burrows-Wheeler compression algorithm, using C++ and templates. This is the same algorithm for BZip.