Funktionen für Sortieralgorithmen

const int length = 20;

Nur bei Arrays mit Werten bis zu ca. 70 sinnvoll.

void print2(int daten[]) {
	for (int i = 0; i < length; i++) {
		for (short j = 0; j < daten[i]; j++) {
			cout << "-";
		}
		cout << "X\n";
	}
}

void main() {
 
	int daten[length];
 
	srand(time(NULL));
	for (int i = 0; i < length; i++) {
		daten[i] = rand()%length;
	}
 
	getch();
}

#include <windows.h>
 
void main() {
	int daten[length];
 
	double start = GetTickCount();
	//Variablen
	LONGLONG g_Frequency, g_CurentCount, g_LastCount;
	//Frequenz holen
	if (!QueryPerformanceFrequency((LARGE_INTEGER*)&g_Frequency))
		std::cout << "Performance Counter nicht vorhanden" << std::endl;
	//1. Messung
	QueryPerformanceCounter((LARGE_INTEGER*)&g_CurentCount);
 
// SORTIEREN
 
	//2. Messung
	QueryPerformanceCounter((LARGE_INTEGER*)&g_LastCount);
	double dTimeDiff = (((double)(g_LastCount-g_CurentCount))/((double)g_Frequency));
	std::cout << "Zeit: " << dTimeDiff << std::endl;
 
	getch();
}