Open Source Linux Algorithms - Page 17

This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).

Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other.

This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available. For the latest releases please visit https://github.com/rwpenney/spfpm

A Simple console-based Sudoku Solver.

in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits

Software to solve Linear Programming problems applying the Revised Simplex Algorithm (2-Phase Method) and performing a Sensitivity Analysis too.

SketchyLISP is a highly portable, embeddable interpreter for purely applicative Scheme.

Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.

SolTrack is a simple, free, fast and accurate C/C++ routine to compute the position of the Sun. The code can be used to track the Sun on low-specs machine, such as a PLC or a microcontroller, and can be used for e.g. (highly) concentrated (photovoltaic) solar power. SolTrack has been developed by Marc van der Sluys, Paul van Kan and Jurgen Reintjes, of the Lectorate of Sustainable Energy at the HAN University of Applied Sciences in Arnhem, The Netherlands. The code is based on the astronomical Fortran library libTheSky and can be used, modified and distributed under the conditions of version 3 of the GNU Public Licence.

This is a small Java swing application that shows different sorting algorithms working on the same set of data. The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work.

Command line encryption tool for one time, daemon, or stream data processing. Data stats, check sums, conversion to/from text. Data/keys from files, pipes, standard input. In-place/diverted processing or data-analysis-only. Random, file, password keys.

Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

Небольшая и быстрая библиотека написанная на javascript, которая генерирует псевдослучайные числа с практически непредсказуемым разбросом вероятности выпадения для каждого генерируемого числа, а также случайно динамическими границами диапазона псевдослучайной последовательности (для каждого генерируемого числа). Другими словами: эта библиотека ведет себя настолько не предсказуемо, что иногда выдает неопределенное значение (NaN) или бесконечность (Infinity), и почему это происходит не знает даже сам разработчик!

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

The SFTL (Simple Functional Template Library) is a C++ library that attempts to leverage the use of the C++ STL through functional programming concepts.

The target of this project is to build easy, reliable, flexible and universal Java Configuration Tool.

Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/.

Wisconsin White Matter Hyperintensity Segmentation [W2MHS] and Quantification Toolbox is an open source MatLab toolbox designed for detecting and quantifying White Matter Hyperintensities (WMH) in Alzheimer’s and aging related neurological disorders. WMHs arise as bright regions on T2- weighted FLAIR images. They reflect comorbid neural injury or cerebral vascular disease burden. Their precise detection is of interest in Alzheimer’s disease (AD) with regard to its prognosis. Our toolbox provides a self-sufficient set of tools for segmenting these WMHs reliably and further quantifying their burden for down-processing studies.

The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign. In the course of performing that assign any retrieve operations indicated in the text are performed before committing the assign. That is all there the system does. The driving motivation for this design is that as far as we know, the human mind supports these two instructions.It may have additional mechanisms that create new assigns, but using the results of these mechanisms requires a system built from these instructions.

WORDFIELD is an extremely fast incremental word list generator. It's meant for use with a password recovery tool such as John the Ripper or aircrack-ng.

yaghi (Yet Another GrapH Implementation) is a Free (as Freedom) Implementation in C++ for the data structure "Graph" using the STL library.

Yaobi is a fast collision detection library for general triangulated objects. It uses a hierarchical representation based on oriented bounding boxes. Yaobi compares well with other libraries when it comes to speed and memory consumption.

B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.

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