A time complexity that grows proportionally with the square of the input size.
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Quadratic Time Complexity
The scenario in which an algorithm takes an average amount of time to solve a given problem.
Average case
A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
Linearithmic Time Complexity
Out-of-place Sort
Big-O notation
An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
A time complexity that combines the efficiency of linear time and logarithmic time.
Merge Function
Stable sort
A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
A method for solving a problem by dividing it into progressively smaller subproblems.
Space complexity
Comparison-based Sort
The amount of memory an algorithm requires to solve a problem as a function of the size of the input.
The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.
Pseudocode
A sorting algorithm that necessitates extra memory in order to arrange the array.