The big sort routine implements a way to sort huge amounts of data using C programming language. It sorts the 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 Niklaus Wirth. Additionally, this routine recognizes small amounts of data that do fit into memory and resorts to a in-place quicksort.
Ubiqx is a collection of ANSI C compatible modules for implementing linked lists, binary trees, caching and spare arrays. The goal of the ubiqx project is to develop a set of clean, small, re-usable code modules which implement fundamental constructs and mechanisms, and to make them available under the terms of the GNU Library General Public License (LGPL).
This program demonstrates a few routines for processing binary sort trees. It uses a binary sort tree of strings. The
In this post we are going to write C++ program to implement stack data structure using Templates in C++. Stack
This is a C Program to perform list traversal operation using linked list. This C program to show the basic functions of linked list such as add, delete, append and delete.
This is a C Program to implement tree data structure. It uses current working directory as the root and traverse all files inside the directory and prints them on the screen. You can use any C/C++ compilers to compile and run this program however, it is tested using Turbo C++ Compiler only.
