Open Source C Algorithms - Page 4

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

Modified NCBI Toolkit for Windows, added contextual BLAST algorithm.

Cryptography Tools is a project to develop demonstration tools on classic (currently Caesar and Playfair) & modern crypto-systems, including private & public key encryptions, digital signatures, cryptographic hashes and authenticated encryption.

CthughaNix is the reincarnation of Cthugha-L, a Linux port of one of the first audio visualization software packages, known as "An Oscilloscope On Acid".

With this application you can know all, about current time! Day, month, year, Week day, clock (hours, minutes and seconds), time of execution of application (years, months, weeks, days, hours, minutes and seconds). -> This application has a miniscule consumption of resources. -> This application doesn't need any configuration just need to be executed.

D-List is an extensive, production quality, and robust list management subsystem written in C that can be used as a shared library or compiled directly into your project. D-List provides access to 3 classes of lists, and allows extensive manipulation and customization of these lists. D-List lists can also be easily incorporated as primitives into larger treed, or nested data management systems. D-List implements a comprehensive set of linked list primitives that provides multiple forms of both sequential and random element access, bi-directional movement within a list, and an extensive set of list and element manipulation and reordering features. It also provides for an expansive set of user functions that can be added to lists and called automatically, to efficiently implement a broad range of services using the list primitives as underlying technology. It was written primarily for accuracy and speed, and provides extensive debugging support for easy code development.

DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language.

An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link).

Data Structure Tester is an OCaml application for multiple testing of various data structures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.

With this application you will know, instantly the time difference between two dates in the form of date, days, hours, minutes, and seconds!

From the early 1970s up to nowadays the system date routines of computers usually mix up date with time calculations. Not only that they will expire sooner or later due to number overflow. Not only that this will make calendarian calculations extremely complicated. Fact is, that this will combine two things together which don't have anything to do with each other: The rotation of the earth around itself and the rotation of the earth around the sun, which in addition will both vary during the chiliads. So how will you be able to do date calculations if you then even try to consider time gimmicks like summer/winter time changes, leap-seconds and so on? Just forget it! This project gives you very short pure date routines that are the fastest ones that you can get, because they don't need any looping for doing their calculations, and they do their calculations from 1/1/0 up to 12/31/9999. Of course they precisely consider the transition from Julian to Gregorian calendar. ;-)

Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file

We introduce our implementation that accelerates the distance matrix computation in the x86 and Cell Broadband Engine (BE) architecture, a homogeneous and heterogeneous multi-core system, respectively.

DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html

Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.

This is a general purpose expression evaluator which has abilities to evaluate mathematical expressions having operators: +, -, *, /, < , <=, >, >=, ==, !=, &&, ||. The enhancement to support all the other arithmetic operators is under development.

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

FPM - Fixed Point Math substitutes expensive floating point operations by much cheaper integer arithmetics. Use this library in your plain C (gcc) projects if you like.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

FastFlow is a C/C++ programming framework supporting the development of pattern-based parallel programs on multi/many-core, GPUs and distributed platforms. FastFlow run-time is built upon non-blocking threads and lock-free queues. Thanks to its very efficient CAS-free communication/synchronization support (e.g. few clock cycles core-to-core latency), FastFlow effectively supports the exploitation of fine grain parallelism, e.g. parallel codes managing very high frequency streams on commodity multi-core. FastFlow works on x86, x86_64, PPC, ARM, and Linux, Mac and Win XP/7. From Jan 1, 2018 code development migrated on GitHub at https://github.com/fastflow/fastflow

This library is available on GitHub: https://github.com/ronflima/feijuca Get it from there.

A C library, providing comfortable APIs for a wide range of Finite State Abstract Machines (NFA, DFA, FST, Bimachines, etc). Implements most of the classical algorithms in the field.

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.