Search Results for "quicksort"
Sort By:
Showing 18 open source projects for "quicksort"
View related business solutions-
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
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... -
2
paraffin
Iterative and recursive parallelism generics for Ada 2005 and Ada 2012
A suite of Ada 2012 generics to facilitate iterative and recursive parallelism for multicore systems and provide safer recursion for single and multicore systems. Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees -
3
uLib
User mode C/C++ extended API library for Win32 programmers.
uLib adds tons of utility functions to enhance and simplify Win32 development. Some of it is implemented as C++ classes, however, much of it is implemented as C functions. The purpose of the lib is to add functions "missing" in Win32, simplify tasks that are tedious in plain Win32, and generally make Your, and my, development process easier and faster. This lib has been the staple of my x86/x64 development for decades, and is now open sourced for the benefit of the community. It is... -
4
Fast stable sorting in Delphi
Routines to sort large arrays of various types, simple and Tobject.
Significant gains in processing times when sorting arrays with structure in the data. Pre-sorted arrays with relatively few modifications may be sorted 20-30 times faster than Delphi's default QuickSort. The project includes a test suite. -
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
5
Play-With-Sort-OC
Repository implemented in Objective-C with sorting algorithms
Play-With-Sort-OC is a learning-oriented repository implemented in Objective-C that demonstrates several classic sorting algorithms with code examples (selection sort, bubble sort, insertion sort, quick sort variants, heap sort, etc). The goal is educational; by showing how each algorithm works with animations or clear visualizations in an iOS/Objective-C context, the author helps developers understand not just the “how” but also the “why” behind each algorithm. The repo is especially suited... -
6
Sorting_Algo_Lib
Sorting Algotithms lib
Visual studio 2010 solution which generates dll with sorting API's which can be easily inteagrted in any windows application. All API's will provide options to input "int" or "float" arrays for sorting. -
7
The program create large array of doubles (automatically drop extra data to hard disk if needed) and sort them by quicksort algorithm.
-
8
Parallel Quicksort with MPI
Parallel Quicksort with MPI
...The main aim of this study is to implement the QuickSort algorithm using the Open MPI library and therefore compare the sequential with the parallel execution. -
9
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
CUDA-quicksort is a GPU-based implementation of the quicksort algorithm. CUDA-quicksort is designed to exploit the power computing of modern NVIDIA GPUs. "Two GPU-based implementations of the quicksort were presented in literature: the GPU-quicksort, a compute-unified device architecture (CUDA) iterative implementation, and the CUDA dynamic parallel (CDP) quicksort, a recursive implementation provided by NVIDIA Corporation."[*]. -
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
PedrosoGameWork
Um pequeno framework didático de games em Java
Com finalidades didáticas, a ideia de criar um pequeno framework em Java, que resolva os problemas básicos de mecânicas e ferramentas para games, nasceu pelo fato do Java não ter suporte nativo a games (tipo um XNA/MonoGame da vida) e esse fato é tão realista que Java não oferece suporte nativo a leitura de um joystick/gamepad. Sendo assim, esse framework não tem a pretensão de competir com qualquer outro que já exista em Java, mas sim ser um guia de referência bem documentada de como... -
11
Una panoramica con prove su liste di più elementi sui seguenti metodi di ordinamento: -Selezione -Inserzione -Heapsort -Quicksort -Mergesort -Radixsort
-
12
Visual Sort
See sorting algorithms.
Various sorting algorithms implemented into a graphical representation. A tool I created for others to learn, as well for me. Please tell me if I have any bugs, or if I could rewrite code anywhere! -
13
ExtraDix (EXTended RADIX) is a sorting algorithm based on radix sort. It can sort by all basic types, it is stable; sorting time increases linear with number of records. From a few hundred records onwards it is faster than Quicksort.
-
14
ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.
-
15
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
-
16
jAlgorithms is a project mainly for educational purposes. It contains some of the popular algorithms and data structures.
-
17
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
-
18
Gune is a neat and portable general purpose C library that implements common data structures like linked lists, trees and stacks, and highly optimized algorithms like binary search, quicksort, and more.
- Previous
- You're on page 1
- Next
