Tag: Algorithms

Bayer-Trees implementation in C

This is implementation of Bayer-Trees, which are normally used for indices of data bases. These routines provide all stuff that is needed to create and destroy; insert, update and delete; load and destroy; search and traverse; check a tree. Sort huge amounts of data by doing a multi-phase sorting on temporary files.

Read More

Generating fast sorting routines

In a lot of programs my gensort-utility turned out to be very useful. It consists simply of the header file “gensort.h”, contained in the above package. To obtain a sorting routine, simply define the name of the...

Read More

Sort Huge amount of data

The bigsort routine implements a way to sort huge amounts of data that do not fit into main memory by using a multi-phase sorting on files. It is a implementation from the book “Algorithms and data structures” by...

Read More

Standard Function Library – ANSI C

The SFL (Standard Function Library) is an open source portable function library for C/C++ programs. Written by iMatix, the SFL provides about 450 functions for compression, encryption, encoding, datatype conversion and formatting, dates, times, calendars, internet programming (MIME, CGI) and many more.

Read More