Showing 2 open source projects for "sorting algorithm"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • eProcurement Software Icon
    eProcurement Software

    Enterprises and companies seeking a solution to manage all their procurement operations and processes

    eBuyerAssist by Eyvo is a cloud-based procurement solution designed for businesses of all sizes and industries. Fully modular and scalable, it streamlines the entire procurement lifecycle—from requisition to fulfillment. The platform includes powerful tools for strategic sourcing, supplier management, warehouse operations, and contract oversight. Additional modules cover purchase orders, approval workflows, inventory and asset management, customer orders, budget control, cost accounting, invoice matching, vendor credit checks, and risk analysis. eBuyerAssist centralizes all procurement functions into a single, easy-to-use system—improving visibility, control, and efficiency across your organization. Whether you're aiming to reduce costs, enhance compliance, or align procurement with broader business goals, eBuyerAssist helps you get there faster, smarter, and with measurable results.
    Learn More
  • 1

    Primes

    Calculate primes by using extremely fast sorting

    This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Bouc-Wen-Baber-Noori model of hysteresis

    Compute parameters of the Bouc-Wen-Baber-Noori model of hysteresis

    This toolbox computes the parameters of the Bouc–Wen–Baber–Noori hysteresis model using Multiobjective optimization evolutionary algorithms (MOBEAs). The toolbox uses the NSGA − II algorithm, which is an elitist non–dominated sorting EA. The toolbox uses the original NSGA-II algorithm developed by Prof. Kalyanmoy Deb, which can be download from: http://www.iitk.ac.in/kangal/codes.shtml Prof. Deb allowed me to use and post this toolbox. For further information about the toolbox read the documentation and the following papers: - Kalyanmoy Deb, Sameer Agrawal, Amrit Pratap, T Meyarivan. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next