• OEIS

  • Referenced in 3387 articles [sw07248]
  • check if someone has discovered this algorithm before? You decide to ask the OEIS ... steps needed for ”sorting by list merging”, a well-known algorithm. The entry directs...
  • Quicksort

  • Referenced in 144 articles [sw20694]
  • which are among the fastest generic-sorting algorithms available, as testified by the choice ... Quicksort as the default sorting algorithm in most programming libraries. Some sorting algorithms are adaptive ... better for inputs, which are nearly sorted, according to some specified measure of presortedness. Quicksort...
  • heapsort

  • Referenced in 61 articles [sw34903]
  • science, heapsort is a comparison-based sorting algorithm. Heapsort can be thought ... scan of the unsorted region; rather, heap sort maintains the unsorted region in a heap ... place algorithm, but it is not a stable sort. Heapsort was invented ... could sort an array in-place, continuing his earlier research into the treesort algorithm...
  • SMS-EMOA

  • Referenced in 74 articles [sw11894]
  • comparing the results of evolutionary multiobjective optimisation algorithms (EMOA). The new idea ... with the concept of non-dominated sorting. The algorithm’s population evolves to a well...
  • PAES

  • Referenced in 93 articles [sw04159]
  • Niched Pareto Genetic Algorithm (NPGA) and a nondominated sorting GA (NSGA). Tests were carried...
  • CGAL

  • Referenced in 355 articles [sw00118]
  • data structures. All these data structures and algorithms operate on geometric objects like points ... Library offers geometric object generators and spatial sorting functions, as well as a matrix search...
  • GPUTeraSort

  • Referenced in 14 articles [sw12706]
  • management. We present a novel external sorting algorithm using graphics processors (GPUs) on large databases ... billions of records and wide keys. Our algorithm uses the data parallelism within ... intensive threads on the GPU. Our new sorting architecture provides multiple memory interfaces ... significantly improve the performance of sorting algorithms on large databases...
  • NCAlgebra

  • Referenced in 54 articles [sw07755]
  • extensive sorting and display features as well as algorithms for automatically discarding ”redundant” polynomials...
  • Algorithm 347

  • Referenced in 10 articles [sw36275]
  • Algorithm 347: an efficient algorithm for sorting with minimal storage. TOMS347 is a FORTRAN77 library ... which implements ACM TOMS algorithm 347, for sorting an integer array...
  • MOPED

  • Referenced in 11 articles [sw02388]
  • ranking method of non-dominated sorting genetic algorithm-II and the Parzen estimator to approximate ... lying on the Pareto front. The proposed algorithm has been applied to different types ... crowding distance described in non-dominated sorting genetic algorithm...
  • Leonardo

  • Referenced in 6 articles [sw29857]
  • range from the implementation of classical algorithms (sorting algorithms, graph algorithms etc.) to graphical demos...
  • AS 307

  • Referenced in 57 articles [sw14162]
  • require O(n 3 ) steps. The algorithm proposed here computes both depths in O(nlogn ... time, by combining geometric properties with certain sorting and updating mechanisms. Both types of depth ... quality indices and control charts. Moreover, the algorithm can be extended to the computation...
  • ACE

  • Referenced in 8 articles [sw22675]
  • evaluation of the complexity of particular algorithms; little effort, however, has been devoted ... able to analyze reasonably large programs, like sorting programs, in a fully mechanical ... illustrated with the analysis of a sorting algorithm. Related works and further improvements are discussed...
  • Thrust

  • Referenced in 51 articles [sw09618]
  • scan, sort, and reduce, which can be composed together to implement complex algorithms with concise...
  • MCSTL

  • Referenced in 10 articles [sw06825]
  • that make use of the STL algorithms like sort, random_shuffle, partial...
  • Spatial Sorting

  • Referenced in 4 articles [sw11153]
  • Spatial sorting. CGAL User and Reference Manual: Many geometric algorithms implemented in CGAL are incremental ... order of insertion. This package provides sorting algorithms that may considerably improve running times ... such algorithms. The rationale is to sort objects along a space-filling curve so that ... sorting functions usually improve memory locality of the data structures produced by incremental algorithms, sometimes...
  • CUDPP

  • Referenced in 6 articles [sw12697]
  • data-parallel algorithm primitives such as parallel prefix-sum (“scan”), parallel sort, and parallel reduction ... wide variety of data-parallel algorithms, including sorting, stream compaction, and building data structures such...
  • PAD1

  • Referenced in 4 articles [sw03439]
  • algorithm (CSA). Solution method: Use of sorting algorithms to classify a cluster of atoms into...
  • GPU-ABiSort

  • Referenced in 4 articles [sw20473]
  • approach competitive with common sequential sorting algorithms not only from a theoretical viewpoint ... combining the optimal time approach with algorithms optimized for small input sequences). We present ... hardware (GPUs). On GPUs, our optimal parallel sorting approach has shown to be remarkably faster ... also faster than previous non-optimal sorting approaches on the GPU for sufficiently large input...
  • SNARK

  • Referenced in 4 articles [sw19611]
  • support for special unification algorithms, sorts, answer construction for program synthesis, procedural attachment, and extensibility...