esche/Schule
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

kleine Optimierung

Browse source
This commit is contained in:
Leaced 2017-04-10 15:35:59 +02:00
parent 44adba5ffe
commit 86dab66e54
1 changed files with 12 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
Sortieralgorithmen/BubbleSort.cpp
View file

@ -51,13 +51,18 @@ void BubbleSort(int *array, unsigned short amount)
for(unsigned short idx = 0; idx+1<amount; idx++) std::cout << array[idx] << ", ";
std::cout << array[amount-1] << "\n"; //Ausgabe des unsortierten Arrays
for(unsigned short idx = 0; idx<amount-1; idx++)
bool changed = true;
for(unsigned short idx = 0; idx<amount-1 && changed; idx++)
{
changed = false;
for(unsigned short idx2 = amount-1; idx2>idx; idx2--) if(array[idx2]<array[idx2-1])
{
int temp = array[idx2-1];
array[idx2-1] = array[idx2];
array[idx2] = temp;
changed = true;
}
for(unsigned short idx2 = 0; idx2+1<amount; idx2++) std::cout << array[idx2] << ", ";
@ -72,13 +77,18 @@ void BubbleSort(long double *array, unsigned short amount)
for(unsigned short idx = 0; idx+1<amount; idx++) std::cout << array[idx] << ", ";
std::cout << array[amount-1] << "\n"; //Ausgabe des unsortierten Arrays
for(unsigned short idx = 0; idx<amount-1; idx++)
bool changed = true;
for(unsigned short idx = 0; idx<amount-1 && changed; idx++)
{
changed = false;
for(unsigned short idx2 = amount-1; idx2>idx; idx2--) if(array[idx2]<array[idx2-1])
{
int temp = array[idx2-1];
array[idx2-1] = array[idx2];
array[idx2] = temp;
changed = true;
}
for(unsigned short idx2 = 0; idx2+1<amount; idx2++) std::cout << array[idx2] << ", ";