Open Source Algorithms - Page 30

Lago is a study-oriented library of classic data structures and algorithms implemented in JavaScript with an emphasis on readability and learning. Instead of aiming to be a production runtime, it serves as a reference you can step through to understand how arrays, stacks, queues, linked lists, trees, heaps, graphs, and sorting/searching routines actually work. The implementations favor clarity over micro-optimizations, making them approachable for learners who are new to algorithmic thinking or coming from non-CS backgrounds. Because the code is idiomatic JavaScript, it also helps front-end engineers strengthen fundamentals without switching languages. The repository’s structure lets you browse topic by topic and compare trade-offs such as time versus space complexity. It’s a handy companion to interview prep lists: after reading a concept, you can open the matching Lago implementation and trace it line by line.

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.

YABI93 is an Interpreter for the esoteric programming language Befunge, version "Befunge93". It is written in Java 1.5 and uses Swing for its graphical interface. YABI supports a multilanguage GUI.

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

Zero Sum Game Solver JavaScript Library

Zipline is a Pythonic algorithmic trading library. It is an event-driven system for backtesting. Zipline is currently used in production as the backtesting and live-trading engine powering Quantopian -- a free, community-centered, hosted platform for building and executing trading strategies. Quantopian also offers a fully managed service for professionals that includes Zipline, Alphalens, Pyfolio, FactSet data, and more. Installing Zipline is slightly more involved than the average Python package. For a development installation (used to develop Zipline itself), create and activate a virtualenv, then run the etc/dev-install script. Please note that Zipline is not a community-led project. Zipline is maintained by the Quantopian engineering team, and we are quite small and often busy.

Learn how to programm in c++ This project includes example Programms of Algorithm and Datastructure. Three students of Htwg Konstanz will release regularly example Programms in order that other people can learn c++. The first sources will be about search

Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint.

Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc.

aptimelib is a new, extremely portable, generic, 64-bit, time/date library. It implements the proposal by David R. Tribble ( http://david.tribble.com/text/c0xlongtime.html ), featuring epoch basis, microsecond granularity, and platform translation.

Can emulate old computer on text the code pogram ideal to create kernel for operating system The begin the project the can emulate CPU(8080)and z80.

This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

A collection of parallel image processing algorithms in pure Go. The aim of this project is simplicity in use and development over absolute high performance, but most algorithms are designed to be efficient and make use of parallelism when available. It uses packages from the standard library whenever possible to reduce dependency use and development abstractions. All operations return image types from the standard library. Package convolution provides the functionality to create and apply a kernel to an image. Package effect provides the functionality to manipulate images to achieve various looks. Package histogram provides basic histogram types and functions to analyze RGBA images. Package paint provides functions to edit a group of pixels on an image. Package parallel provides helper functions for the dispatching of parallel jobs.

brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).

BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).

Expresses C program in graphical control flow chart in VCG GDL.

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

Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications.

The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

Public description: The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

Backwards mappable double linked list for Common Lisp.

clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.

An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.