Function
| Static Public Summary | ||
| public |
dual(partition: *): * |
|
| public |
dualtco(partition: *): * |
|
| public |
single(partition: callable): * Template for the recursive implementation of quicksort. |
|
| public |
singletco(partition: callable): * Template for the recursive implementation of quicksort with explicit tail call optimization. |
|
Static Public
public dual(partition: *): * source
import {dual} from '@comparison-sorting/quick-sort/src/dual.js'Params:
| Name | Type | Attribute | Description |
| partition | * |
Return:
| * |
public dualtco(partition: *): * source
import {dualtco} from '@comparison-sorting/quick-sort/src/dualtco.js'Params:
| Name | Type | Attribute | Description |
| partition | * |
Return:
| * |
public single(partition: callable): * source
import {single} from '@comparison-sorting/quick-sort/src/single.js'Template for the recursive implementation of quicksort. This template allows to generate a specific version of the quicksort algorithm for a certain partitioning algorithm.
Params:
| Name | Type | Attribute | Description |
| partition | callable | the implementation for the partitioning step |
Return:
| * |
public singletco(partition: callable): * source
import {singletco} from '@comparison-sorting/quick-sort/src/singletco.js'Template for the recursive implementation of quicksort with explicit tail call optimization. This template allows to generate a specific version of the quicksort algorithm for a certain partitioning algorithm.
Params:
| Name | Type | Attribute | Description |
| partition | callable | the implementation for the partitioning step |
Return:
| * |