Algorithms | - MYCPLUS

Find the middle element of linked list in C

In order to find middle element of linked list in one pass, you need to maintain two pointers, one increment at each node while other increments after two nodes at a time. By having this arrangement, when first pointer reaches end, second pointer will point to middle element of linked list.

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

Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition

Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For Internet developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there’s no better...

Data Structures and Algorithm Analysis in C++ (2nd Edition)

In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical...

Data Structures and Algorithm Analysis in Java

Provides a proven approach to algorithms & data structures using the exciting Java programming language as the implementation tool. With Java, the author highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as...

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

Operations Research : Applications and Algorithms (with CD-ROM and InfoTrac)

Intended as a intermediate text in management science programs, this text explains operations research, emphasizing model formulation and model building as being of equal importance to the interpretation of software output. Winston (Indiana U.) discusses sensitivity...

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 Niklaus Wirth. Additionally, this routine...

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

Standard Function Library

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

The Standard C++ Library: Generic algorithms

Algorithms are at the core of computing. To be able to write an algorithm once and for all to work with any type of sequence makes your programs both simpler and safer. The ability to customize algorithms at runtime has revolutionalized software development.The subset...

C Implementation of Various Sorting Algorithms

This is a simple C implementation of various sorting algorithms such as Bubble Sort, Insertion Sort, Selection Sort and Shell Sort. Bubble Sort Bubble sort, is a simple comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent...