Quicksort
[Algorithms]

---

Detailed Description

TODO.

Defines
#define	ph_qsMemswap(ptrone, ptrtwo, tempptr, size)
Typedefs
typedef int32_t(*	ph_qs_compare_fn )(const void *_one, const void *_two)
Functions
int32_t	ph_quicksort_partition (const void *arr, const int32_t low, const int32_t high, const uint32_t size, uint8_t *tempptr, ph_qs_compare_fn compare)
void	ph_quicksort_recursive (const void *arr, const int32_t low, const int32_t high, const uint32_t size, uint8_t *tempptr, ph_qs_compare_fn compare)
void	ph_quicksort_iterative (const void *arr, const int32_t low, const int32_t high, const uint32_t size, uint8_t *tempptr, ph_qs_compare_fn compare)
int32_t	ph_qs_sort_uint32_t (const uint32_t nelements, uint32_t *array, const uint32_t method)
int32_t	ph_qs_compare_uint32_t (const void *_one, const void *_two)
int32_t	ph_qs_randomfill_uint32_t (const uint32_t nelements, uint32_t *array, const uint32_t maxval)
int32_t	ph_qs_print_uint32_t (const uint32_t nelements, const uint32_t *array)
int32_t	ph_qs_verify_uint32_t (const uint32_t nelements, const uint32_t *array)

Copyright (C) 2002 - 2007

Philip D.S. Thoren ( pthoren@users.sourceforge.net ) University Of Massachusetts at Lowell Robotics Lab

---