A

Algorithm

Rust implementation of the Damerau-Levenshtein difference algorithm

The Algorithm Collection contains several examples of well known algorithms implemented in C programming language.

A variant of the A* algorithm to solve the game of Taquin. Efficient c++20 algorithm that can be tested online!

My lab assignments for IT013IU Data Structures & Algorithms course at HCMIU.

A command line interface for discretionary traders / manual - hybrid trading with a powerful order design system for Binance + FTX. For manual traders who prefer a keyboard over using a mouse. Mostly to gain a speed advantage over everyone else.

A browser-based tool that identifies inconsistencies in JSON key structures with lightning speed. Detects duplicate keys, case issues, whitespace problems, and misspelled keys using a memory-efficient algorithm. Built with vanilla JavaScript and optimized for processing large datasets.

Hbox is a commandline-terminal sokoban solver written in Ada. It is "generic" in the sense that it contains no domain specific strategies. It also provides a demonstration of the advantage in using the Hungarian Algorithm, for Windows, OSX, & linux.

Featuring

* no installation * no dependencies * simply unzip in your Downloads directory, and run.

An algorithm for irregular rectangles/boxes that map 1:1 with a square grid

Kaprekar's Constant

Neutron Spectrum Unfolding via GRAVEL

Reverse Polish Notation visualization

ATM задачка. Выполнено в 3 версиях: самые простые услвоия, полный перебор, динамическим программированием.

This project/library contains common algorithms...

Segmenting static scene from a Visionary-T point cloud Topics: #algorithm #point-cloud #sample #sick-appspace

Este proyecto es un programa que encuentra las soluciones de laberintos de area NxN utilizando el algoritmo de busqueda informada A* creado para el curso de Inteligencia Artifical de la carrera Ingenieria Civil Informatica de la Universidad Catolica de la Santisima Concepción

Small C++ helpers that come in handy every now and then.

The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.

Algorithms and more in modern C++. These algorithms are all being unit tested.

Personal notes for Grokking Algorithm book by Aditya Bhargava

Реализация продвинутиых алгоритмов и связанных с ними графов.