Search Results for "sorting algorithm"
Sort By:
Showing 28 open source projects for "sorting algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
Our Free Plans just got better! | Auth0You 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.
-
1
Swift Algorithm Club
Algorithms and data structures in Swift, with explanations
Swift Algorithm Club is a repository collecting implementations of many common algorithms and data structures in the Swift language, with accompanying explanations. Its focus is educational: it emphasizes clarity and readability of code rather than high-performance library-grade implementations. The repository covers searching, sorting, graph algorithms, data structures (trees, queues, etc.), and some machine learning style utilities, intended for learning, practicing, or interview preparation. -
2
JavaScript Algo and Data Structures
Algorithms and data structures implemented in JavaScript
javascript-algorithms is an open source repository by Oleksii Trekhleb that provides implementations of algorithms and data structures in JavaScript. Each algorithm includes explanations, complexity analysis, and references for further reading, making it both a coding resource and a study guide. The repository covers topics such as sorting, searching, graph algorithms, cryptography, and data structures like linked lists, stacks, and queues. It is designed to help developers understand algorithm... -
3
LeetCode Animation
Demonstrate all the questions on LeetCode in the form of animation
..., dynamic programming, graph traversal, sorting, and other common algorithm techniques. This project is particularly helpful for those preparing for interviews at top tech companies. -
4
BifurcumLib
A library for running through a directional graph.
This is the library for the project Bifurcum. It does all the work. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This library sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. -
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
5
Bifurcum
Software to run through a directional graph.
This software runs through a directional graph and writes the paths it found as test specifications. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This application sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. Technically it is a front end for the library Bifurcumlib. -
6
DISTOD
Distributed discovery of bidirectional order dependencies
The DISTOD data profiling algorithm is a distributed algorithm to discover bidirectional order dependencies (in set-based form) from relational data. DISTOD is based on the single-threaded FASTOD-BID algorithm [1], but DISTOD scales elastically to many machines outperforming FASTOD-BID by up to orders of magnitude. Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table. They can express that, for example, sorting books... -
7
Bzip2 for Windows
A block-sorting file compressor, v1.0.6 for Win-32
Bzip2 compresses files using the Burrows-Wheeler block sorting text compression algorithm, and Huffman coding. Compression is generally considerably better than that achieved by more conventional LZ77/LZ78-based compressors, and approaches the performance of the PPM family of statistical compressors. by Julian Seward. -
8
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
9
iLib
The most comprehensive library of Javascript i18n classes available
Note: development has been moved over to github! Please see https://github.com/iLib-js/iLib "I18N" means way more than just translation. Other libraries claim to be an i18n solution when translation and string formatting is really all they offer. Yes, iLib has classes that do translation too, but there is also much, much more. From date formatting to name parsing to phone number handling to collation, iLib has classes that do it. And, it has the ability to support thousands of possible... -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
10
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file. The program was written in C++ using a main algorithm of a heap...
-
11
-
12
Parallel Quicksort with MPI
Parallel Quicksort with MPI
Sorting is used in human activities and devices like personal computers, smart phones, and it continues to play a crucial role in the development of recent technologies. The QuickSort algorithm has been known as one of the fastest and most efficient sorting algorithm. It was invented by C.A.R Hoare in 1961and is using the divide-and-conquer strategy for solving problems [3]. Its partitioning aspects make QuickSort amenable to parallelization using task parallelism. MPI is a message passing... -
13
intzip
Fast compression of integer sets.
IntZip is a lossless compression algorithm for strictly increasing lists of unsigned integers. Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list... -
14
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
15
PageRank for wikipedia
PageRank algorithm for wikipedia pages on Amazon Elastic MapReduce
• Implemented the project using PageRank algorithm for Wikipedia pages on Amazon Elastic MapReduce. • Designed MapReduce jobs for red links removal, outlink adjacency graph, compute the total number of pages, PageRank calculation, sorting of PageRanks. • To run the project on amazon Elastic MapReduce specify jar location. Pass the directory locations as an argument of input and output respectively. -
16
Binary Tree Sort
An implementation of Binary Tree Sort
An implementation of the Binary Tree Sort sorting algorithm. -
17
LAVA for AFM
Lloyd's Algorithm-based Volumetric Analysis for AFM Images
This MATLAB-based program enables analysis of AFM images. In particular, it allows the user to measure the volume of all distinguishable features in an image and to isolate and sort those particles. As the name implies, LAVA uses Lloyd's Algorithm, also known as k-means sorting, to identify a small set of volumes representative of the actual distribution of particle in the image. Although developed for determining feature volume, LAVA is also completely compatible with other types of image... -
18
EToS (Efficient Technology of Spike sorting; Extracellular recording To Spike trains) is an open-source system for spike sorting. EToS contains the programs of spike detection, feature extraction and clustering.
-
19
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.
-
20
Xinok Sort
A stable sorting algorithm with a low memory requirement
Xinok sort is a custom sorting algorithm, a variant of merge sort which uses significantly less memory while maintaining speed and stability. This project has been abandoned and superseded by this: https://github.com/Xinok/XSort -
21
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.
-
22
This is an implementation of an out of core sorting algorithm 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.
-
23
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.
-
24
Hash Sort is a form distribution sorting algorithm 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 sorting algorithm.
-
25
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.
