mirror of
https://github.com/NGSolve/netgen.git
synced 2024-11-14 10:08:32 +05:00
47 lines
1.0 KiB
C++
47 lines
1.0 KiB
C++
|
#ifndef FILE_SORT
|
||
|
|
#define FILE_SORT
|
||
|
|
|
||
|
|
/**************************************************************************/
|
||
|
|
/* File: sort.hh */
|
||
|
|
/* Author: Joachim Schoeberl */
|
||
|
|
/* Date: 07. Jan. 00 */
|
||
|
|
/**************************************************************************/
|
||
|
|
|
||
|
|
namespace netgen
|
||
|
|
{
|
||
|
|
|
||
|
|
// order(i) is sorted index of element i
|
||
|
|
extern void Sort (const Array<double> & values,
|
||
|
|
Array<int> & order);
|
||
|
|
|
||
|
|
extern void QuickSort (const Array<double> & values,
|
||
|
|
Array<int> & order);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
inline void BubbleSort (int size, T * data)
|
||
|
|
{
|
||
|
|
T hv;
|
||
|
|
for (int i = 0; i < size; i++)
|
||
|
|
for (int j = i+1; j < size; j++)
|
||
|
|
if (data[i] > data[j])
|
||
|
|
{
|
||
|
|
hv = data[i];
|
||
|
|
data[i] = data[j];
|
||
|
|
data[j] = hv;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T>
|
||
|
|
inline void BubbleSort (Array<T> & data)
|
||
|
|
{
|
||
|
|
if(data.Size() > 0)
|
||
|
|
BubbleSort (data.Size(), &data[data.Begin()]);
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|