Open Source Linux Algorithms - Page 4

Some tools for discussion about algorithms. 1) an evaluating tool for complexity

A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas.

ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl.

Algorithms and data structures implemented in JavaScript with explanations and links to further readings

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.

LR(k) parser generator (k>=0) implementation.

The algorithm will carving zeros in an integer array initialized to "1". Data can be recorded in a simple way.

Matho is a OS Independant Application and API for mathematical operations, features include curve sketching, calculus, iterative formulae, algebra solver, 2d/3d geometry and mechanical and statistical functionality.

A simple component usable for converting a non-deterministic finite automaton to a deterministic finite automaton.

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.

an educating tool generating heightmaps (heightmap terrains) with various algorithms, teaching how they work and how to use them, and letting you very easily try your own ideas