Recursive vs Quicksort - What's the difference?
recursive | quicksort |
drawing upon itself, referring back.
(mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms
(computing, not comparable) of a program or function that calls itself
(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time
(computing theory, not comparable, of a set) whose characteristic function is recursive (4)
(computing) A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.
*1987 , Åke Wikström, Functional Programming Using Standard ML
*:Somewhat surprisingly, the average behaviour of quicksort is the same as the best behaviour.
(computing) To sort with such an algorithm.
*1991 , Maguire et al'', ''Geographical Information Systems: Principles and Applications
*:The first and last subsets are then recursively quicksorted .
As an adjective recursive
is drawing upon itself, referring back.As a noun quicksort is
a sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.As a verb quicksort is
to sort with such an algorithm.recursive
English
Adjective
{{examples-right, sense=function, The factorial function - : : where n is any natural number greater than 0}} (en adjective)- The recursive nature of stories which borrow from each other
