AI & ChatGPT searches , social queries for IN PLACE-ALGORITHM
Search references for IN PLACE-ALGORITHM. Phrases containing IN PLACE-ALGORITHM
See searches and references containing IN PLACE-ALGORITHM!
Search references for IN PLACE-ALGORITHM. Phrases containing IN PLACE-ALGORITHM
See searches and references containing IN PLACE-ALGORITHM!IN PLACE-ALGORITHM
Type of computer science algorithm
In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional
In-place_algorithm
Fast Fourier Transform algorithm
The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete
Cooley–Tukey_FFT_algorithm
Sequence of operations for a task
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve
Algorithm
Algorithm that arranges lists in order
In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order
Sorting_algorithm
Algorithm for the kth smallest element in an array
implemented as an in-place algorithm, and beyond selecting the kth element, it also partially sorts the data. See selection algorithm for further discussion
Quickselect
Sorting algorithm using the heap data structure
degenerate. Heapsort is an in-place algorithm, but it is not a stable sort. Heapsort was invented by J. W. J. Williams in 1964. The paper also introduced
Heapsort
Divide and conquer sorting algorithm
merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations of merge sort are stable, which means that the relative
Merge_sort
Method for finding minimum spanning trees
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a
Prim's_algorithm
Variant of heap data structure
in the heapsort sorting algorithm, which is an in-place algorithm as binary heaps can be implemented as an implicit data structure, storing keys in an
Binary_heap
Algorithm for shuffling a finite sequence
The modern version of the algorithm takes time proportional to the number of items being shuffled and shuffles them in place. The Fisher–Yates shuffle
Fisher–Yates_shuffle
Comparison-based sorting algorithm
published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of O(n log n) operations (see big O notation)
Smoothsort
Algorithm used for pathfinding and graph traversal
A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality
A*_search_algorithm
Sorting algorithm
In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it
Counting_sort
Divide and conquer sorting algorithm
sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for
Quicksort
algorithms. Brent's algorithm: finds a cycle in function value iterations using only two iterators Floyd's cycle-finding algorithm: finds a cycle in function
List_of_algorithms
Non-comparative lexicographical selection algorithm
do not have to be in sorted order. While the simplest implementation of radix selection is as an in-place algorithm, out-of-place parallel variants have
Radix_selection
Algorithm for visible surface determination in 3D graphics
The painter's algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works
Painter's_algorithm
Quantum search algorithm
In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high
Grover's_algorithm
Recursive algorithm for matrix multiplication
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix
Strassen_algorithm
I/O-efficient algorithm regardless of cache size
In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having
Cache-oblivious_algorithm
Linear programming algorithm
Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient
Karmarkar's_algorithm
Competitive algorithm for searching a problem space
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA) in computer
Genetic_algorithm
Sorting algorithm in computer science
Interpolation sort (or histogram sort) is a sorting algorithm that uses an interpolation formula to divide and conquer. It is a variant of bucket sort
Interpolation_sort
Algorithm that employs a degree of randomness as part of its logic or procedure
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random
Randomized_algorithm
Algorithm that begins on possibly incomplete inputs
In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed
Online_algorithm
Algorithm for finding sub-text location(s) inside a given sentence in Big O(n) time
In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within
Knuth–Morris–Pratt_algorithm
Algorithm for linear programming
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived
Simplex_algorithm
Maekawa's algorithm is an algorithm for mutual exclusion on a distributed system. The basis of this algorithm is a quorum-like approach where any one
Maekawa's_algorithm
Approximation for the travelling salesman problem
The Christofides algorithm or Christofides–Serdyukov algorithm is an algorithm for finding approximate solutions to the travelling salesman problem, on
Christofides_algorithm
Latin phrase that translates literally to 'on site'
speech. An algorithm is said to be an in situ algorithm, or in-place algorithm, if the extra amount of memory required to execute the algorithm is O(1).
In_situ
Clustering and community detection algorithm
The Leiden algorithm is a community detection algorithm developed by Traag et al at Leiden University. It was developed as a modification of the Louvain
Leiden_algorithm
Line-drawing algorithm
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a
Bresenham's_line_algorithm
Cryptographic system with public and private keys
with the underlying algorithm by both the sender and the recipient, who must both keep the key secret. Of necessity, the key in every such system had
Public-key_cryptography
Method for finding kth smallest value
In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of orderable values,
Selection_algorithm
Discrete Fourier transform algorithm
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT), or its inverse (IDFT), of a sequence. A Fourier transform
Fast_Fourier_transform
Algorithm that combines multiple sorted lists into one
inputs lists in sorted order. These algorithms are used as subroutines in various sorting algorithms, most famously merge sort. The merge algorithm plays a
Merge_algorithm
String searching algorithm
In computer science, the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-search
Boyer–Moore string-search algorithm
Boyer–Moore_string-search_algorithm
Perfectly interleaved playing card shuffle
505K. doi:10.1126/science.216.4545.505. PMID 17735734. Jain, Peiyush (May 2008). "A simple in-place algorithm for in-shuffles". arXiv:0805.1598 [cs.DS].
Faro_shuffle
Algorithm used for points in euclidean space
In electrical engineering and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P
Lloyd's_algorithm
Estimate of time taken for running an algorithm
takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that
Time_complexity
from outside in within a range. The rotation works for an even or odd number of array elements. The reversal algorithm uses three in-place rotations to
Block_swap_algorithms
Subset of evolutionary computation
Evolutionary algorithms (EA) reproduce essential elements of biological evolution in a computer algorithm in order to solve "difficult" problems, at least
Evolutionary_algorithm
Problem in computer science
The problem of non-square in-place transposition has been studied since at least the late 1950s, and several algorithms are known, including several
In-place_matrix_transposition
Node ordering for directed acyclic graphs
ordering, and there are linear time algorithms for constructing it. Topological sorting has many applications, especially in ranking problems such as feedback
Topological_sorting
Vector quantization algorithm minimizing the sum of squared deviations
k-medoids algorithm, an approach which forces the center point of each cluster to be one of the actual points, i.e., it uses medoids in place of centroids
K-means_clustering
Algorithm for supervised learning of binary classifiers
In machine learning, the perceptron is an algorithm for supervised learning of binary classifiers. A binary classifier is a function that can decide whether
Perceptron
Alternative form of government or social ordering
also referred to as algorithmic regulation, regulation by algorithms, algorithmic governance, algocratic governance, algorithmic legal order, or algocracy
Government_by_algorithm
Optimization algorithm
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Algorithm for computing the value of a transcendental number
A spigot algorithm is an algorithm for computing the value of a transcendental number (such as π or e) that generates the digits of the number sequentially
Spigot_algorithm
Sorting algorithm
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient
Insertion_sort
Standard for the encryption of electronic data
published in 1977. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data. In the
Advanced_Encryption_Standard
Video-focused social media platform
misinformation, offensive content, addictive algorithm, its role during the Gaza war, and, following its 2026 divestiture in the U.S., alleged censorship of criticism
TikTok
Type of sorting algorithm
sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted
Tree_sort
Multiplication algorithm
Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen in 1971. It
Schönhage–Strassen_algorithm
Sorting algorithm
sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions
Samplesort
Method for generating heightmaps for computer graphics
The diamond-square algorithm is a method for generating heightmaps for computer graphics. It is a slightly better algorithm than the three-dimensional
Diamond-square_algorithm
Approximate string matching algorithm
bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm. The algorithm tells
Bitap_algorithm
Algorithm for determinants of integers
In mathematics, the Bareiss algorithm, named after Erwin Bareiss, is an algorithm to calculate the determinant or the echelon form of a matrix with integer
Bareiss_algorithm
Unsolved problem in computer science
function on the size of the input to the algorithm. The general class of questions that some algorithm can answer in polynomial time is "P" or "class P".
P_versus_NP_problem
2026 studio album by Natalie Imbruglia
Algorithm is the seventh studio album by Australian-British singer-songwriter Natalie Imbruglia. The album was announced in April 2026 and is scheduled
Algorithm (Natalie Imbruglia album)
Algorithm_(Natalie_Imbruglia_album)
Quantum algorithm for solving systems of linear equations
The Harrow–Hassidim–Lloyd (HHL) algorithm is a quantum algorithm for obtaining certain limited information about the solution to a system of linear equations
HHL_algorithm
Determines the points needed for rasterizing a circle
In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It is a generalization
Midpoint_circle_algorithm
Method to solve optimization problems
(linear) function defined on this polytope. A linear programming algorithm finds a point in the polytope where this function has the largest (or smallest)
Linear_programming
Algorithm that multiplies two signed binary numbers in two's complement notation
multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented
Booth's multiplication algorithm
Booth's_multiplication_algorithm
Computation method
In elementary arithmetic, a standard algorithm or method is a specific method of computation which is conventionally taught for solving particular mathematical
Standard_algorithms
Algorithm used by Google Search to rank web pages
PageRank (PR) is an algorithm used by Google Search to rank web pages in their search engine results. It is named after both the term "web page" and co-founder
PageRank
Algorithm to multiply two numbers
multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient
Multiplication_algorithm
Fast method for calculating the digits of π
Chudnovsky algorithm is a fast method for calculating the digits of π, based on Ramanujan's π formulae. Published by the Chudnovsky brothers in 1988, it
Chudnovsky_algorithm
Decision tree algorithm
In decision tree learning, ID3 (Iterative Dichotomiser 3) is a greedy algorithm invented by Ross Quinlan used to generate a decision tree from a dataset
ID3_algorithm
Mathematical and computational problem
involving placing each item into the first bin in which it will fit. It requires Θ(n log n) time, where n is the number of items to be packed. The algorithm can
Bin_packing_problem
Art genre
Algorithmic art or algorithm art is art, mostly visual art, in which the design is generated by an algorithm. Algorithmic artists are sometimes called
Algorithmic_art
Attempts to formalize the concept of algorithms
Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers
Algorithm_characterizations
Line-breaking algorithm used in the TeX typesetting package
The Knuth–Plass algorithm is a line-breaking algorithm designed for use in Donald Knuth's typesetting program TeX. It integrates the problems of text justification
Knuth–Plass line-breaking algorithm
Knuth–Plass_line-breaking_algorithm
Method for division with remainder
A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or
Division_algorithm
Algorithms to complete a sudoku
(checking row, column, and box constraints) then the algorithm advances to the next cell and places a "1" in that cell. When checking for violations, if it
Sudoku_solving_algorithms
Algorithm in computational number theory
In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm
Pollard's_kangaroo_algorithm
Monte Carlo algorithm
In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random
Metropolis–Hastings_algorithm
Practice and study of secure communication techniques
practice; cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in actual practice by any
Cryptography
Efficient sorting algorithm that combines insert and merge operations
is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big O notation) in-place stable sorting
Block_sort
Change to Google's search results ranking algorithm
Google Panda is an algorithm used by the Google search engine, introduced in February 2011. The main goal of this algorithm is to improve the quality of
Google_Panda
Type system used in computer programming and mathematics
programmer-supplied type annotations or other hints. Algorithm W is an efficient type inference method in practice and has been successfully applied on large
Hindley–Milner_type_system
Type of randomized algorithm
In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it
Las_Vegas_algorithm
O(n) sorting algorithm
efficiently rearranges the input to place the buckets in the correct order, then sorts each bucket. The original algorithm sorts an input array A as follows:
Flashsort
Combinatorial algorithm
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M.
Steinhaus–Johnson–Trotter algorithm
Steinhaus–Johnson–Trotter_algorithm
Mathematical procedure
then their ratio is rational and the algorithm eventually terminates. The Ferguson–Forcade algorithm was published in 1979 by Helaman Ferguson and R.W. Forcade
Integer_relation_algorithm
Computer science data structure
methods being in-place and with no quadratic worst-case scenarios. Selection algorithms: A heap allows access to the smallest or largest element in constant
Heap_(data_structure)
Algorithm for virtual memory implementation
In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes
Page_replacement_algorithm
Sequence merge algorithm in computer science
In computer science, k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists
K-way_merge_algorithm
Algorithm in computer graphics to add color or texture
For a boundary-fill, in place of the target color, a border color would be supplied. In order to generalize the algorithm in the common way, the following
Flood_fill
Property of an algorithm
In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm
Algorithmic_efficiency
Book by Pedro Domingos
The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World is a book by Pedro Domingos released in 2015. Domingos wrote
The_Master_Algorithm
Technological phenomenon with social implications
Algorithmic bias describes systematic and repeatable harmful tendency in a computerized sociotechnical system to create "unfair" outcomes, such as "privileging"
Algorithmic_bias
Non-comparative lexicographical sorting algorithm
In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according
Radix_sort
Method of executing orders
traders. In the twenty-first century, algorithmic trading has been gaining traction with both retail and institutional traders. A study in 2019 showed
Algorithmic_trading
Belarusian competitive programmer (born 1994)
Match Champion, 2014, 2019, 2020, 2021 Algorithm Champion Google Hash Code: champion 2019, 2020 and 2021 2nd place - Team name- Past Glory Google Code Jam:
Gennady_Korotkevich
Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed
Raymond's_algorithm
Problem in combinatorial optimization
thus there is no known algorithm that is both correct and fast (polynomial-time) in all cases. There is no known polynomial algorithm which can tell, given
Knapsack_problem
Humorous sorting algorithm
algorithms and complexity analysis). Slowsort is a recursive algorithm. It sorts in-place. It is an unstable sort. (It might change the order of equal-valued
Slowsort
Binary arithmetic algorithm
In computer programming, the exclusive or swap (sometimes shortened to XOR swap) is an algorithm that uses the exclusive or bitwise operation to swap the
XOR_swap_algorithm
Fast approximate median algorithm
In computer science, the median of medians is an approximate median selection algorithm, frequently used to supply a good pivot for an exact selection
Median_of_medians
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM
IN PLACE-ALGORITHM