This repository has been archived on 2024-09-24. You can view files and clone it, but cannot push or open issues or pull requests.
Schule/Sortieralgorithmen/SelectionSort.cpp

63 lines
1.4 KiB
C++
Raw Normal View History

2017-04-02 15:59:33 +02:00
#include<iostream>
#include<conio.h>
#include<string>
#include<sstream>
2017-04-09 12:43:54 +02:00
#include<cstdlib>
#include<ctime>
2017-04-02 15:59:33 +02:00
int main()
{
std::string input;
2017-04-08 17:51:54 +02:00
unsigned short amount = 1;
2017-04-02 15:59:33 +02:00
2017-04-08 17:51:54 +02:00
std::cout << "Gib die Anzahl der Zahlen ein: ";
2017-04-02 15:59:33 +02:00
getline(std::cin, input);
std::stringstream(input) >> amount;
long double array[amount];
2017-04-09 12:43:54 +02:00
std::cout << "\nM\x94 \bchtest du mit zuf\x84lligen Zahlen arbeiten? y/n ";
getline(std::cin, input);
if(input == "y" || input == "Y")
2017-04-02 15:59:33 +02:00
{
2017-04-09 12:43:54 +02:00
srand(time(0));
for(unsigned short idx = 0; idx < amount; idx++)
{
array[idx] = rand()%100;
}
}
else
{
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];
}
2017-04-02 15:59:33 +02:00
}
std::cout << "\n";
for(unsigned short idx =0; idx<amount-1; idx++) std::cout << array[idx] << ", ";
2017-04-05 13:12:55 +02:00
std::cout << array[amount-1] << "\n"; //Ausgabe des unsortierten Arrays
2017-04-02 15:59:33 +02:00
for(unsigned short idx = 0; idx<amount-1; idx++)
{
unsigned short indexMin = idx;
2017-04-05 13:12:55 +02:00
for(unsigned short idx2 = idx+1; idx2<amount; idx2++) if(array[idx2]<array[indexMin]) indexMin = idx2;
2017-04-02 15:59:33 +02:00
if(indexMin!=idx)
{
long double temp = array[idx];
array[idx] = array[indexMin];
array[indexMin] = temp;
}
for(unsigned short idx =0; idx<amount-1; idx++) std::cout << array[idx] << ", ";
2017-04-05 13:12:55 +02:00
std::cout << array[amount-1] << "\n"; //Ausgabe des Arrays nach jedem Sortierungsschritt
2017-04-02 15:59:33 +02:00
}
getch();
return(0);
}