Sorting

Functions
void	mergeSort (int *arr, int l, int r)
	Sort array. More...
void	mergeSort_with_idx (int *arr, int *arr_idx, int l, int r)
	Sort array and an associated index list. More...
void	mergeSort_with_idx2 (int *arr, int *arr_idx1, int *arr_idx2, int l, int r)
	Sort array and two associated index lists. More...
void	quickSort (int *arr, int l, int h)
	Sort array. More...
void	quickSort_with_idx (int *arr, int *arr_idx, int l, int h)
	Sort array and its array of indices. More...
void	quickSort_with_idx2 (int *arr, int *arr_idx1, int *arr_idx2, int l, int h)
	Sort array and two associated index lists. More...
void	timSort (int *arr, int l, int r)
	Sort array. More...
void	timSort_with_idx (int *arr, int *arr_idx, int l, int r)
	Sort array and an associated index list. More...
void	timSort_with_idx2 (int *arr, int *arr_idx1, int *arr_idx2, int l, int r)
	Sort array and two associated index lists. More...

Detailed Description

Sorting algorithms used internally by DistDir library

Function Documentation

mergeSort()

void mergeSort	(	int *	arr,
		int	l,
		int	r
	)

Sort array.

Sort array using mergesort algorithm

Parameters

[in]	arr	Array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

mergeSort_with_idx()

void mergeSort_with_idx	(	int *	arr,
		int *	arr_idx,
		int	l,
		int	r
	)

Sort array and an associated index list.

Sort array and an associated index list using mergesort algorithm

Parameters

[in]	arr	Array to be sorted
[in]	arr_idx	Index list array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

mergeSort_with_idx2()

void mergeSort_with_idx2	(	int *	arr,
		int *	arr_idx1,
		int *	arr_idx2,
		int	l,
		int	r
	)

Sort array and two associated index lists.

Sort array and two associated index lists using mergesort algorithm

Parameters

[in]	arr	Array to be sorted
[in]	arr_idx1	First Index list array to be sorted
[in]	arr_idx2	Second Index list array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

quickSort()

void quickSort	(	int *	arr,
		int	l,
		int	h
	)

Sort array.

Sort array using quicksort algorithm

Parameters

[in]	arr	Array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

quickSort_with_idx()

void quickSort_with_idx	(	int *	arr,
		int *	arr_idx,
		int	l,
		int	h
	)

Sort array and its array of indices.

Sort array and an associated index list using quicksort algorithm

Parameters

[in,out]	arr	Array to be sorted
[in,out]	arr_idx	Array of indices following the sorting of arr
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

quickSort_with_idx2()

void quickSort_with_idx2	(	int *	arr,
		int *	arr_idx1,
		int *	arr_idx2,
		int	l,
		int	h
	)

Sort array and two associated index lists.

Sort array and two associated index lists using quicksort algorithm

Parameters

[in,out]	arr	Array to be sorted
[in,out]	arr_idx1	First Index list array to be sorted
[in,out]	arr_idx2	Second Index list array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

timSort()

void timSort	(	int *	arr,
		int	l,
		int	r
	)

Sort array.

Sort array using timsort algorithm using subarrays of size 32

Parameters

[in,out]	arr	Array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

timSort_with_idx()

void timSort_with_idx	(	int *	arr,
		int *	arr_idx,
		int	l,
		int	r
	)

Sort array and an associated index list.

Sort array and an associated index list using timsort algorithm with subarrays of size 32

Parameters

[in,out]	arr	Array to be sorted
[in,out]	arr_idx	Index list array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted

timSort_with_idx2()

void timSort_with_idx2	(	int *	arr,
		int *	arr_idx1,
		int *	arr_idx2,
		int	l,
		int	r
	)

Sort array and two associated index lists.

Sort array and two associated index lists using timsort algorithm with subarrays of size 32

Parameters

[in,out]	arr	Array to be sorted
[in,out]	arr_idx1	First index list array to be sorted
[in,out]	arr_idx2	Second index list array to be sorted
[in]	l	First index of the array to be sorted
[in]	r	Last index of the array to be sorted