Search Results for "sorting algorithm"
Sort By:
Showing 39 open source projects for "sorting algorithm"
View related business solutions-
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.
-
MongoDB Atlas runs apps anywhereMongoDB 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.
-
1
Shapes
Graphical programming. Includes n-dimensional sorting.
Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this. -
2
headsort
headsort: streaming sort + 2x faster than gnu sort
headsort sorts files by line and fields. Options can pick field order and etc. In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done... -
3
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. -
4
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. -
Deliver secure remote access with OpenVPN.OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
-
5
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... -
6
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. -
7
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. -
8
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... -
9
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...
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
-
11
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... -
12
Animal-AV
Animal Algorithm Animation System
Animal is a Java-based system for visualizing and animating algorithms and data structures. Available since 1999, it is one of the established AV systems, and provides one of the largest collections of supported algorithms. Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting. -
13
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... -
14
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
... of the quicksort algorithm. "Experiments performed on six sorting benchmark distributions show that CUDA-quicksort is up to four times faster than GPU-quicksort and up to three times faster than CDP-quicksort."[*]. *Copyright © 2015 John Wiley & Sons, Ltd. Concurrency Computat.: Pract. Exper. (2015) DOI: 10.1002/cpe.3611 For further information, please see the corresponding publication: http://onlinelibrary.wiley.com/doi/10.1002/cpe.3611/abstract -
15
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... -
16
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); [...] } -
17
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. -
18
Binary Tree Sort
An implementation of Binary Tree Sort
An implementation of the Binary Tree Sort sorting algorithm. -
19
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... -
20
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.
-
21
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... -
22
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.
-
23
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 -
24
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.
-
25
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.
