Header file for the Quicksort algorithm.
More...
Go to the source code of this file.
Namespaces |
namespace | TypeIIRMLMath |
Functions |
void | TypeIIRMLMath::Quicksort (const int &LeftBound, const int &RightBound, double *ArrayOfValues) |
| Standard implementation of the Quicksort algorithm for double values.
|
Detailed Description
Header file for the Quicksort algorithm.
Header file for the Quicksort algorithm to be used for within in the library of the Type II OTG algorithm. The Quicksort function is part of the namespace TypeIIRMLMath.
- Date:
- March 2014
- Version:
- 1.2.6
- Author:
- Torsten Kroeger, <info@reflexxes.com>
- Copyright:
- Copyright (C) 2014 Google, Inc.
GNU Lesser General Public License
This file is part of the Type II Reflexxes Motion Library.
The Type II Reflexxes Motion Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
The Type II Reflexxes Motion Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along with the Type II Reflexxes Motion Library. If not, see <http://www.gnu.org/licenses/>.