Keywords

#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 to the input size. In other words, it modifies the input in place, without creating a separate copy of the data structure. An algorithm which is not in-place is sometimes called not-in-place or out-of-place.

Tue 10th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

In-place algorithm Cooley–Tukey FFT algorithm Algorithm Quickselect Sorting algorithm Heapsort Merge sort Fisher–Yates shuffle Knuth–Morris–Pratt algorithm A* search algorithm
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.