Bubble Sort
This commit is contained in:
parent
74d09fc2a8
commit
44adba5ffe
1 changed files with 87 additions and 0 deletions
87
Sortieralgorithmen/BubbleSort.cpp
Normal file
87
Sortieralgorithmen/BubbleSort.cpp
Normal file
|
@ -0,0 +1,87 @@
|
||||||
|
#include<iostream>
|
||||||
|
#include<conio.h>
|
||||||
|
#include<string>
|
||||||
|
#include<sstream>
|
||||||
|
#include<cstdlib>
|
||||||
|
#include<ctime>
|
||||||
|
|
||||||
|
void BubbleSort(long double *array, unsigned short amount);
|
||||||
|
void BubbleSort(int *array, unsigned short amount);
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
std::string input;
|
||||||
|
unsigned short amount = 1;
|
||||||
|
|
||||||
|
std::cout << "Gib die Anzahl der Zahlen ein: ";
|
||||||
|
getline(std::cin, input);
|
||||||
|
std::stringstream(input) >> amount;
|
||||||
|
|
||||||
|
std::cout << "\nM\x94 \bchtest du mit zuf\x84lligen Zahlen arbeiten? y/n ";
|
||||||
|
getline(std::cin, input);
|
||||||
|
if(input == "y" || input == "Y")
|
||||||
|
{
|
||||||
|
int *array = new int[amount];
|
||||||
|
srand(time(0));
|
||||||
|
for(unsigned short idx = 0; idx < amount; idx++) array[idx] = rand()%1000;
|
||||||
|
BubbleSort(array, amount);
|
||||||
|
delete[] array;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
long double *array = new long double[amount];
|
||||||
|
for(unsigned short idx = 0; idx < amount; idx++)
|
||||||
|
{
|
||||||
|
std::cout << "Gib die " << idx+1 << ". Zahl ein: ";
|
||||||
|
getline(std::cin,input);
|
||||||
|
std::stringstream(input) >> array[idx];
|
||||||
|
}
|
||||||
|
BubbleSort(array, amount);
|
||||||
|
delete[] array;
|
||||||
|
}
|
||||||
|
|
||||||
|
getch();
|
||||||
|
return(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
void BubbleSort(int *array, unsigned short amount)
|
||||||
|
{
|
||||||
|
std::cout << "\n";
|
||||||
|
|
||||||
|
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++)
|
||||||
|
{
|
||||||
|
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;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(unsigned short idx2 = 0; idx2+1<amount; idx2++) std::cout << array[idx2] << ", ";
|
||||||
|
std::cout << array[amount-1] << "\n"; //Ausgabe des Arrays nach jedem Sortierungsschritt
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void BubbleSort(long double *array, unsigned short amount)
|
||||||
|
{
|
||||||
|
std::cout << "\n";
|
||||||
|
|
||||||
|
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++)
|
||||||
|
{
|
||||||
|
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;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(unsigned short idx2 = 0; idx2+1<amount; idx2++) std::cout << array[idx2] << ", ";
|
||||||
|
std::cout << array[amount-1] << "\n"; //Ausgabe des Arrays nach jedem Sortierungsschritt
|
||||||
|
}
|
||||||
|
}
|
Reference in a new issue