quicksort declaration
More...
#include <stdlib.h>
#include <xt/sort_common.h>
Go to the source code of this file.
|
void | xt_quicksort_int (int a[], size_t n) |
|
void | xt_quicksort_xt_int (Xt_int a[], size_t n) |
|
void | xt_quicksort_idxpos (idxpos_type v[], size_t n) |
|
void | xt_quicksort_index (Xt_int *restrict a, int n, int *restrict idx, int reset_index) |
|
void | xt_quicksort_xt_int_permutation (Xt_int *restrict a, size_t n, int *restrict permutation) |
|
void | xt_quicksort_int_permutation (int *restrict a, size_t n, int *restrict permutation) |
|
◆ xt_quicksort_idxpos()
quicksort changing structured values
- Parameters
-
[in,out] | v | array to be sorted |
[in] | n | length of data |
◆ xt_quicksort_index()
void xt_quicksort_index |
( |
Xt_int *restrict | a, |
|
|
int | n, |
|
|
int *restrict | idx, |
|
|
int | reset_index ) |
quicksort changing values and indices
- Parameters
-
[in,out] | a | array to be sorted |
[in] | n | number of elements in a and idx |
[in,out] | idx | old index of sorted returned a |
[in] | reset_index | override given idx by identity idx |
Definition at line 71 of file quicksort.c.
◆ xt_quicksort_int()
void xt_quicksort_int |
( |
int | a[], |
|
|
size_t | n ) |
quicksort changing structured values
- Parameters
-
[in,out] | a | array of ints to be sorted |
[in] | n | length of data |
- Examples
- test_sort.c.
◆ xt_quicksort_int_permutation()
void xt_quicksort_int_permutation |
( |
int *restrict | a, |
|
|
size_t | n, |
|
|
int *restrict | permutation ) |
quicksort sorting values and indices
- Parameters
-
[in,out] | a | array of n ints to be sorted |
[in] | n | length of data |
[in,out] | permutation | contents permuted exactly as a and used to resolve ordering if two elements of a have the same value |
- Examples
- test_xmap_intersection_parallel.c.
◆ xt_quicksort_xt_int()
void xt_quicksort_xt_int |
( |
Xt_int | a[], |
|
|
size_t | n ) |
quicksort changing structured values
- Parameters
-
[in,out] | a | array of ints to be sorted |
[in] | n | length of data |
◆ xt_quicksort_xt_int_permutation()
void xt_quicksort_xt_int_permutation |
( |
Xt_int *restrict | a, |
|
|
size_t | n, |
|
|
int *restrict | permutation ) |
quicksort changing values and indices
- Parameters
-
[in,out] | a | array to be sorted |
[in] | n | number of elements in a and idx |
[in,out] | permutation | contents permuted exactly as a and used to resolve ordering if two elements of a have the same value |