Search Results for "sorting algorithm" - Page 2
Sort By:
Showing 44 open source projects for "sorting algorithm"
View related business solutions-
Grafana: The open and composable observability platformGrafana is the open source analytics & monitoring solution for every database.
-
Build Securely on AWS 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.
-
1
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.
-
2
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 -
3
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.
-
4
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.
-
Dun and Bradstreet Risk Analytics - Supplier IntelligenceRisk, procurement, and compliance teams across the globe are under pressure to deal with geopolitical and business risks. Third-party risk exposure is impacted by rapidly scaling complexity in domestic and cross-border businesses, along with complicated and diverse regulations. It is extremely important for companies to proactively manage their third-party relationships. An AI-powered solution to mitigate and monitor counterparty risks on a continuous basis, this cutting-edge platform is powered by D&B’s Data Cloud with 520M+ Global Business Records and 2B+ yearly updates for third-party risk insights. With high-risk procurement alerts and multibillion match points, D&B Risk Analytics leverages best-in-class risk data to help drive informed decisions. Perform quick and comprehensive screening, using intelligent workflows. Receive ongoing alerts of key business indicators and disruptions.
-
5
Ford-Johnson algorithm, AKA merge insertion sorting. The public-domain implementation of this theoretically interesting sorting algorithm. The point of this algo is low number of comparsions between elements.
-
6
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.
-
7
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.
-
8
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.
-
9
-
Desktop and Mobile Device Management SoftwareDesktop Central is a unified endpoint management (UEM) solution that helps in managing servers, laptops, desktops, smartphones, and tablets from a central location.
-
10
To-do application for SymbianOS mobile devices based on Nokia Series 60. It has smart sorting algorithm which shows most important item first.
-
11
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.
-
12
-
13
STAR, stand-alone advanced c++ algorithm library, addressing mathematical/statistical problems, genetic algorithms, and a framework of system functions (including, but not limited to, XML parsing and writing, sorting, hashing, etc.)
-
14
This project provides a library of standard data types (lists, trees, graphs, semaphores, locks, points, vectors, matrices, shapes, etc.) and standard algorithms (sorting, depth first search, shortest path problem etc.)
-
15
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.
-
16
Robsort in a GNU public license sorting algorithm devleloped by Robert Thompson. Robsort uses random number generation to sort arrays of integers. It is claimed to be the world's least efficient sorting algorithm.
-
17
Searching
Searching algorithm
This algorithm implementation is a combination of linear and binary sorting. There are more than 100 algorithms of searching (that are public). Binary and linear sorting are the most easy to understand algorithms. -
18
Easy Implementation of Sorting
Helpful functionality for sorting and comparing
I have implemented one of the best Sorting Algorithm ! try to Explain & Describe it good & thoroughly.It is based on a simple operation known as merging: combining two ordered arrays to make one larger ordered array. This operation immediately lends itself to a simple recursive sort method known as mergesort: to sort an array, divide it into two halves, sort the two halves (recursively), and then merge the results.Must try if you think it is suitable for your sorting Problems. -
19
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.
