Find the middle element of linked list in C

Data structures and algorithm questions are important part of any programming job interview, whether Java interview, C/C++ interview or any other programming language. Since data structures are core programming concept, it’s mandatory for all programmers, to know...

Algorithms in C

This book provides a comprehensive collection of algorithms implemented in C programming language. A variety of algorithms are described in each of the following areas: sorting, searching, string-processing, and geometric, graph, and mathematical algorithms. These...

B-Tree implementation

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...

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 routine, the data type you want to...
Page 1 of 212