I started in 1983, in 2007 i still on a case!

------ Build started: Project: Array, Configuration: Debug Win32 ------
Compiling...
Array.cpp
d:\visual_c++\ 1 \array\array\array.cpp( 77 ) : warning C4244: 'initializing' : conversion from 'double' to 'size_t', possible loss of data
d:\visual_c++\ 1 \array\array\array.cpp( 130 ) : error C3867: 'Array::ascending': function call missing argument list; use '&Array::ascending' to create a pointer to member
d:\visual_c++\ 1 \array\array\array.cpp( 135 ) : error C3867: 'Array::descending': function call missing argument list; use '&Array::descending' to create a pointer to member
Build log was saved at "file://d:\VISUAL_C++\1\array\Array\Debug\BuildLog.htm"
Array -  2  error(s),  1  warning(s)
========== Build:  0  succeeded,  1  failed,  0  up-to-date,  0  skipped ==========

#ifndef ARRAY_H
#define ARRAY_H

#include "stdafx.h"

class Array 
{
public :
	Array() ;								// кон - ор : указываем количество элементов в динамическом массиве
	void inputElements() ;					// забиваем значениями элементы
	void getMaximumElement() ;				// ищем максимальный элемент ( значение и индекс )
	void getMinimumElement() ;				// ищем минимальный элемент ( значение и индекс )
	void getSumElements() ;					// сумма всех элементов
	int getRepeatElements(double, double) ; 
	void totalNumberRepeatElements( const double *, int, double ) ;// ищем все вхождения элементов равные min/max
	void select() ;							// выбираем тип сортировки массива asc/desc
	void selectionSort( double [], const int, bool( * )( double, double ) ) ; // передаем указатель на asc/desc
	void swap( double * const, double * const ) ; //для обмена
	bool ascending( double, double ) ;		// сортирвока по возрастанию
	bool descending( double, double ) ;		// -//-//-    по убыванию
	~Array() ;								// освобождаем память для динамического массива
private :
	int sizeArray ;
	double *Arr ;
} ;

#endif

#include "stdafx.h"
#include "Array.h"

#include <iostream>
using std :: cout ;
using std :: cin ;
using std :: endl ;

#include <iomanip>
using std :: setw ;
//===============================================================
Array :: Array()
{
	cout << "Quit from programm is : -100 " << endl ;
	cout << "Enter number elements of double array : " ;
	cin >> sizeArray ;
//	if ( sizeArray == -100 )
//		exit	;
	while ( sizeArray ==  0  || sizeArray <  0  )
	{
		cout << "Number of elements not be null or minus! Enter correctly! " << endl ;
		cout << "\nEnter number elements of double array : " ;
		cin >> sizeArray ;
	}
	Arr = new double [ sizeArray ] ;
}
//===============================================================
void Array :: inputElements()
{
	for ( int i =  0 ; i < sizeArray; i++ )
	{
		cout << "Enter " << i << " element of double array : " 
			<< endl << " Arr[ " << i +  1  << " ] = " ;
		cin >> Arr[ i ] ;
		cout << endl ;
	}
}
//===============================================================
void Array :: getMinimumElement()
{
	register double minElement ;
	register double minValue =  0  ;

	minElement = Arr[  0  ] ;
	for ( int next =  0 ; next < sizeArray; next++ )
	{
		switch ( getRepeatElements( Arr[next], minElement ) )
		{
		case  0  :
			minElement = Arr[ next ] ;
			minValue = next ;
		default :
			;
		}
	}
	if ( sizeArray >  1  )
		 totalNumberRepeatElements(Arr, sizeArray, minElement ) ;
}
//===============================================================
int Array :: getRepeatElements( double x, double y)
{
	if ( x < y )
		return  0  ;
	return  1  ;
}
//===============================================================
void Array :: totalNumberRepeatElements(const double* array, int size, double value )
{
	double *repeatArr ;
	register double totalRepeat =  0  ;
	for ( int i =  0 ; i < size; i++ )
	{
		if ( array[ i ] == value )
			totalRepeat++ ;
	}

	repeatArr = new double [ totalRepeat ] ;
	int counter =  0  ;
	for ( int i =  0 ; i < size; i++ )
	{
		if ( array[ i ] == value )
		{
			repeatArr[counter] = i +  1  ;
			counter++ ;
		}
	}

	if ( counter >  1  )
	{
		cout << "The minimum value elements of array repeat in : " << endl ;
		cout << " Arr[ " ;
		for ( int i =  0 ; i < counter; i++ )
			cout << repeatArr[ i ] << ( i < counter -  1  ? ", " : "" ) ;
		cout << " ] " << " = " << value ;
	}
	else
		cout << "The minimum element of double array is : " << endl
		<< "Arr[ " << repeatArr[  0  ] << " ] = " << value << endl ;
}
//===============================================================
void Array :: getSumElements()
{
	register double totalSum =  0  ;
	for 
		( int i =  0 ; i < sizeArray; i++ )
		totalSum += Arr[ i ] ;
	cout << "\n\nTotal sum elements of double array is : "
		<< totalSum << endl ;
}
//===============================================================
int _tmain(int argc, _TCHAR* argv[])
{
	return  0 ;
}
//===============================================================
void Array :: select()
{
	cout <<"\n\nArray before sorting : \n" ;
	for ( int counter =  0 ; counter < sizeArray; counter++ )
		cout << Arr[ counter ] << setw( 7 ) << " " ;

	register int orderSort ;
	cout << "\nEnter 1 to sort in ascending order, \n"
		<< "Enter 2 to sort in descending order : " ;
	cin >> orderSort ;
	if ( orderSort !=  1  || orderSort !=  2  )
		orderSort =  1  ;
	if ( orderSort ==  1  )
	{
		selectionSort( Arr, sizeArray, ascending ) ;
		cout <<"\nData items in ascending order : \n" ;
	}
	else
	{
		selectionSort( Arr, sizeArray, descending ) ;
		cout <<"\nData items in descending order : \n" ;
	}	

	for ( int counter =  0 ; counter < sizeArray; counter++ )
		cout << Arr[ counter ] << setw( 7 ) << " " ;

}
//===============================================================
void Array :: selectionSort(double work[], const int size, bool (*compare)(double, double))
{
	int smallestOrLargest ;
	for ( int i =  0 ; i < size -  1 ; i++ )
	{
		smallestOrLargest = i ;
		for ( int index = i +  1 ; index < size; index++ )
			if ( (*compare)(work[ index ], work[ smallestOrLargest ] ) )
				smallestOrLargest = index ;
		swap( &work[ i ], &work[ smallestOrLargest ] ) ;
	}
}
//===============================================================
void swap( double * const element1Ptr, double * const element2Ptr )
{
	double hold = *element1Ptr ;
	*element1Ptr = *element2Ptr ;
	*element2Ptr = hold ;
}
//===============================================================
bool Array :: ascending( double a, double b )
{
	return a < b ;
}
//===============================================================
bool Array :: descending( double a, double b )
{
	return a > b ;
}
//===============================================================
Array :: ~Array()
{
	delete [ ]Arr ;
}

#include "stdafx.h"
#include "Array.h"

int main()
{
	Array arrayOfElement ;
	arrayOfElement.inputElements() ;
	arrayOfElement.getMinimumElement() ;
	arrayOfElement.getSumElements() ;
	arrayOfElement.select() ;
return  0  ;

I started in 1983, in 2007 i still on a case!

static bool ascending( double, double ) ;		// сортирвока по возрастанию
static bool descending( double, double ) ;		// //-    по убыванию

------ Build started: Project: Array, Configuration: Debug Win32 ------
Linking...
LINK : warning LNK4067: ambiguous entry point; selected 'mainCRTStartup'
Array.obj : error LNK2019: unresolved external symbol "public: void __thiscall Array::swap(double * const,double * const)" (?swap@Array@@QAEXQAN0@Z) referenced in function "public: void __thiscall Array::selectionSort(double * const,int,bool (__cdecl*)(double,double))" (?selectionSort@Array@@QAEXQANHP6A_NNN@Z@Z)
D:\VISUAL_C++\ 1 \array\Debug\Array.exe : fatal error LNK1120:  1  unresolved externals
Build log was saved at "file://d:\VISUAL_C++\1\array\Array\Debug\BuildLog.htm"
Array -  2  error(s),  1  warning(s)
========== Build:  0  succeeded,  1  failed,  0  up-to-date,  0  skipped ==========

I started in 1983, in 2007 i still on a case!

void Array :: swap( double * const element1Ptr, double * const element2Ptr )