Search Results for "sorting algorithm"
Sort By:
Showing 44 open source projects for "sorting algorithm"
View related business solutions-
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.
-
Cloud-based help desk software with ServoDeskWhat 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.
-
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. -
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 fundamentals and practice problem-solving with JavaScript. ... -
3
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. -
4
Smart Hospital Management in C
The Hospital Management System – Doctor Salary Sorting
The Hospital Management System – Doctor Salary Sorting Project demonstrates how fundamental programming concepts in C can be effectively applied to solve practical, real-world problems in the healthcare domain. The project focuses on the use of structures, arrays, and sorting algorithms to manage and organize essential doctor-related data efficiently. By utilizing the Bubble Sort algorithm, the system successfully arranges doctor records in descending order of salary, allowing hospital administrators to easily identify the highest-paid or most experienced doctors. ... -
Turn more customers into advocates.The platform's advanced capabilities ensure companies get the most out of their referral programs. Leverage custom events, profiles, and attributes to enable dynamic, audience-specific referral experiences. Use first-party data to tailor customer segment messaging, rewards, and engagement strategies. Use our flexible APIs to build management capabilities and consumer experiences–headlessly or hybrid. We have all the tools you need to build scalable, secure, and high-performing referral programs.
-
5
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. ... -
6
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. -
7
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. -
8
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. -
9
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. -
Leverage AI to Automate Medical CodingAs a healthcare provider, you should be paid promptly for the services you provide to patients. Slow, inefficient, and error-prone manual coding keeps you from the financial peace you deserve. XpertDox’s autonomous coding solution accelerates the revenue cycle so you can focus on providing great healthcare.
-
10
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. -
11
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. -
12
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 sorting. In this program, specifically users the codes for minimum heap since the purpose of the program is to find the minimum cost or path.
-
13
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... -
14
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. ... -
15
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]. -
16
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. -
17
-
18
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
...CUDA-quicksort is an iterative GPU-based implementation 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 -
19
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. -
20
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); [...] } -
21
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. -
22
Binary Tree Sort
An implementation of Binary Tree Sort
An implementation of the Binary Tree Sort sorting algorithm. -
23
LAVA for AFM
Lloyd's Algorithm-based Volumetric Analysis for 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 analysis, such as fluorescence intensity. Work is in progress to provide three-channel functionality, allowing comparison of relative intensity of red, green, and blue channels in multi-color images. -
24
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. ... -
25
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.
