Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
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.
This is an implementation of an out of core sortingalgorithm based on R-Way merge. Immense in-memory sorting API's are available, however there is a lack of external sorting program API's for application programmers. In this project we address
this concerns by providing a C/C++ API for out of core sorting.
Hash Sort is a form distribution sortingalgorithm when tested it has an O(N) characteristics in most cases. The trade off is memory for space. Here is a very fast optimized recursive implementation of the hash sortingalgorithm.
This project presents another possible solution to the state of kingdom problem and makes use of function sorting concept to minimize the penalty levied on the jobs thus, present a sequence of jobs to be taken up to get the least penalty.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
The Hardware Assisted Visibility Sorting (HAVS) algorithm is a GPU-based, direct volume renderer for unstructured grids. The algorithm operates in both object- and images-space and includes a sample-based, dynamic level-of-detail algorithm.
This is an academic project.
A library and a sample program will be developed, that will implement the Burrows-Wheeler compression algorithm, using C++ and templates.
This is the same algorithm for BZip.
Robsort in a GNU public license sortingalgorithm devleloped by Robert Thompson. Robsort uses random number generation to sort arrays of integers. It is claimed to be the world's least efficient sortingalgorithm.
Secure and customizable compute service that lets you create and run virtual machines.
Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.