Showing 1665 open source projects for "algorithms"

View related business solutions
  • The only CRM built for B2C Icon
    The only CRM built for B2C

    Stop chasing transactions. Klaviyo turns customers into diehard fans—obsessed with your products, devoted to your brand, fueling your growth.

    Klaviyo unifies your customer profiles by capturing every event, and then lets you orchestrate your email marketing, SMS marketing, push notifications, WhatsApp, and RCS campaigns in one place. Klaviyo AI helps you build audiences, write copy, and optimize — so you can always send the right message at the right time, automatically. With real-time attribution and insights, you'll be able to make smarter, faster decisions that drive ROI.
    Learn More
  • Regpack: All-in-One Online Registration and Payment Software Icon
    Regpack: All-in-One Online Registration and Payment Software

    For camps, courses, virtual classes, client billing, events, conferences, meetings, afterschool programs, educational travel, retreats

    Regpack is a powerful onboarding, registration, and payments platform trusted by thousands of organizations worldwide. Our mission is simple: to give you the tools to automate busywork, streamline your processes, and keep your focus where it belongs, on growing your programs and serving your clients.
    Learn More
  • 1
    The Algorithms Python

    The Algorithms Python

    All Algorithms implemented in Python

    The Algorithms-Python project is a comprehensive collection of Python implementations for a wide range of algorithms and data structures. It serves primarily as an educational resource for learners and developers who want to understand how algorithms work under the hood. Each implementation is designed with clarity in mind, favoring readability and comprehension over performance optimization.
    Downloads: 7 This Week
    Last Update:
    See Project
  • 2
    Swift Algorithms

    Swift Algorithms

    Commonly used sequence and collection algorithms for Swift

    Swift Algorithms is an open-source package of sequence and collection algorithms, along with their related types. Algorithms are powerful tools for thought because they encapsulate difficult-to-read and error-prone raw loops. The Algorithms package includes a host of powerful, generic algorithms frequently found in other popular programming languages.
    Downloads: 10 This Week
    Last Update:
    See Project
  • 3
    C# Algorithms

    C# Algorithms

    Plug-and-play class-library project of standard data structures

    Algorithms, a class library project which contains the Algorithms implementations. Data Structures, a class library project which contains the Data Structures implementations. Also, UnitTest, a unit-testing project for the Algorithms and Data Structures.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 4
    Pythonic Data Structures and Algorithms

    Pythonic Data Structures and Algorithms

    Minimal examples of data structures and algorithms in Python

    The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Secure Online Fax and Business Text Messaging Service Icon
    Secure Online Fax and Business Text Messaging Service

    Elevate your business communications with secure SMS and fax solutions.

    Send and receive SMS and fax online, from email, app or with our developer friendly SMS & fax API. HIPAA compliant & ISO 27001 certified. Outstanding value and 5-star service.
    Learn More
  • 5
    Python Outlier Detection

    Python Outlier Detection

    A Python toolbox for scalable outlier detection

    ...PyOD contains multiple models that also exist in scikit-learn. It is possible to train and predict with a large number of detection models in PyOD by leveraging SUOD framework. A benchmark is supplied for select algorithms to provide an overview of the implemented models. In total, 17 benchmark datasets are used for comparison, which can be downloaded at ODDS.
    Downloads: 8 This Week
    Last Update:
    See Project
  • 6
    KACTL

    KACTL

    KTH algorithm competition template library

    KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools, computational geometry routines, and optimization techniques, all designed with speed, correctness, and compactness in mind. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 7
    Zstandard

    Zstandard

    Zstandard - Fast real-time compression algorithm

    ...Zstd can trade compression speed for stronger compression ratios. It is configurable by small increment. Decompression speed is preserved and remain roughly the same at all settings, a property shared by most LZ compression algorithms, such as zlib or lzma.
    Downloads: 69 This Week
    Last Update:
    See Project
  • 8
    LZ4

    LZ4

    Extremely fast compression algorithm

    LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license. This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's...
    Downloads: 275 This Week
    Last Update:
    See Project
  • 9
    PlatEMO

    PlatEMO

    Evolutionary multi-objective optimization platform

    ...PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms published in top journals after 2010. Users can select various figures to be displayed, including the Pareto front of the result, the Pareto set of the result, the true Pareto front, and the evolutionary trajectories of any performance indicator values. PlatEMO provides a powerful and friendly GUI, where users can configure all the settings and perform experiments in parallel via the GUI without writing any code.
    Downloads: 3 This Week
    Last Update:
    See Project
  • SOCRadar Extended Threat Intelligence Platform Icon
    SOCRadar Extended Threat Intelligence Platform

    Get real-time visibility into vulnerabilities, leaked data, and threat actor activity targeting your organization.

    SOCRadar Extended Threat Intelligence, a natively single platform from its inception that proactively identifies and analyzes cyber threats with contextual and actionable intelligence.
    Start Free Trial
  • 10
    OpenSpiel

    OpenSpiel

    Environments and algorithms for research in general reinforcement

    ...OpenSpiel also includes tools to analyze learning dynamics and other common evaluation metrics. Games are represented as procedural extensive-form games, with some natural extensions. The core API and games are implemented in C++ and exposed to Python. Algorithms and tools are written both in C++ and Python. To try OpenSpiel in Google Colaboratory, please refer to open_spiel/colabs subdirectory.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    TextDistance

    TextDistance

    Compute distance between sequences

    Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    DomainBed

    DomainBed

    DomainBed is a suite to test domain generalization algorithms

    DomainBed is a PyTorch-based research suite created by Facebook Research for benchmarking and evaluating domain generalization algorithms. It provides a unified framework for comparing methods that aim to train models capable of performing well across unseen domains, as introduced in the paper In Search of Lost Domain Generalization. The library includes a wide range of well-known domain generalization algorithms, from classical baselines such as Empirical Risk Minimization (ERM) and Invariant Risk Minimization (IRM) to more advanced techniques like Domain Adversarial Neural Networks (DANN), Adaptive Risk Minimization (ARM), and Invariance Principle Meets Information Bottleneck (IB-ERM/IB-IRM). ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 13
    Swift Algorithm Club

    Swift Algorithm Club

    Algorithms and data structures in Swift, with explanations

    Swift Algorithm Club is a project that implements a broad collection of algorithms and data structures in the Swift programming language, with clear commentary and educational intent. Its purpose is not primarily to be a utility library, but rather to teach the how and why behind algorithms—readers can study implementations, complexity, and design choices in a Swift context. The repository includes common classic algorithms (sorting, searching, trees, graphs, dynamic programming, etc.) and structures (queues, heaps, tries, balanced trees) along with writeups explaining them. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    Hello Algorithm

    Hello Algorithm

    Animated illustrations, one-click data structure

    Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 15
    PRML

    PRML

    PRML algorithms implemented in Python

    ...Many of these algorithms are paired with Jupyter notebooks that let users interact with the code, visualize results, and experiment with parameters in a way that deeply strengthens theoretical understanding.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Machine Learning Octave

    Machine Learning Octave

    MatLab/Octave examples of popular machine learning algorithms

    This repository contains MATLAB / Octave implementations of popular machine learning algorithms, along with explanatory code and mathematical derivations, intended as educational material rather than production code. Implementations of supervised learning algorithms (linear regression, logistic regression, neural nets). The author’s goal is to help users understand how each algorithm works “from scratch,” avoiding black-box library calls.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    Flatbush

    Flatbush

    A very fast static spatial index for 2D points and rectangles in JS

    ...An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 18
    trackers

    trackers

    Multi-object tracking algorithms

    trackers is a plug-and-play multi-object tracking library designed to work with virtually any object detection model, enabling developers to follow objects across video frames with minimal setup. The library provides clean, modular implementations of leading tracking algorithms and can be used either from the command line or embedded directly into Python pipelines. It supports inputs such as videos, webcams, RTSP streams, or image directories and produces annotated tracking outputs that include labels and trajectories. Trackers is built for flexibility and benchmarking, allowing users to evaluate performance using standard multi-object tracking metrics and compare algorithms easily. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Rubix ML

    Rubix ML

    A high-level machine learning and deep learning library for PHP

    ...We provide tools for the entire machine learning life cycle from ETL to training, cross-validation, and production with over 40 supervised and unsupervised learning algorithms. In addition, we provide tutorials and other educational content to help you get started using ML in your projects. Our intuitive interface is quick to grasp while hiding alot of power and complexity. Write less code and iterate faster leaving the hard stuff to us. Rubix ML utilizes a versatile modular architecture that is defined by a few key abstractions and their types and interfaces. ...
    Downloads: 3 This Week
    Last Update:
    See Project
  • 20
    bild

    bild

    Image processing algorithms in pure Go

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    EASTL

    EASTL

    EASTL, Electronic Arts Standard Template Library

    EASTL stands for Electronic Arts Standard Template Library. It is a C++ template library of containers, algorithms, and iterators useful for runtime and tool development across multiple platforms. It is a fairly extensive and robust implementation of such a library and has an emphasis on high performance above all other considerations. If you are familiar with the C++ STL or have worked with other templated container/algorithm libraries, you probably don't need to read this.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 22
    CryptoSwift

    CryptoSwift

    Collection of standard and secure cryptographic algorithms

    The master branch follows the latest currently released version of Swift. If you need an earlier version for an older version of Swift, you can specify its version in your Podfile or use the code on the branch for that version. Older branches are unsupported. Swift Package Manager uses debug configuration for debug Xcode build, that may result in significant (up to x10000) worse performance. Performance characteristic is different in Release build. XCFrameworks require Xcode 11 or later and...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 23
    Yangshun Lago

    Yangshun Lago

    Data Structures and Algorithms library in TypeScript and JavaScript

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    ngraph.path

    ngraph.path

    Path finding in a graph

    ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    xxHash

    xxHash

    Extremely fast non-cryptographic hash algorithm

    xxHash is an extremely fast non-cryptographic hash algorithm, working at RAM speed limit. It is proposed in four flavors (XXH32, XXH64, XXH3_64bits and XXH3_128bits). The latest variant, XXH3, offers improved performance across the board, especially on small data. It successfully completes the SMHasher test suite which evaluates collision, dispersion and randomness qualities of hash functions. Code is highly portable, and hashes are identical across all platforms (little / big endian)....
    Downloads: 1 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • 4
  • 5
  • Next
MongoDB Logo MongoDB