Sortieralgorithmen

main
Sebastian Schüler 2023-11-20 13:05:22 +01:00
parent fa974e021f
commit 423babfbbc
9 changed files with 275 additions and 0 deletions

View File

@ -447,6 +447,24 @@ namespace Exercises_C_Sharp
new ExerciseElement(){Name = "008 Enum", Method = Exercises_C_Sharp.Schulaufgaben.S008_Enum.Start}
}
};
//************************
//****Sortieren*******
//************************
ExerciseGroup sortElements = new ExerciseGroup()
{
Name = "Sortieralgorithmen",
ElementList = new List<ExerciseElement>()
{
new ExerciseElement(){Name = "Bubble Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_1.Start},
new ExerciseElement(){Name = "Selection Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_2.Start},
new ExerciseElement(){Name = "Insert Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_3.Start},
new ExerciseElement(){Name = "Heap Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_4.Start},
new ExerciseElement(){Name = "Quick Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_5.Start},
new ExerciseElement(){Name = "Count Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_6.Start},
new ExerciseElement(){Name = "Bogo Sort", Method = Exercises_C_Sharp.XX_Sorting.Exercise_7.Start}
}
};
@ -475,6 +493,7 @@ namespace Exercises_C_Sharp
exceptionElements,
filesystemElements,
mysqlElements,
sortElements,
examElements
};

32
XX_Sorting/Excercise_1.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_1
{
//Sortieren Sie folgende Liste mit Hilfe des Bubble Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Bubble Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_2.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_2
{
//Sortieren Sie folgende Liste mit Hilfe des Selection Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Selection Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_3.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_3
{
//Sortieren Sie folgende Liste mit Hilfe des Insert Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Insert Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_4.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_4
{
//Sortieren Sie folgende Liste mit Hilfe des Heap Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Heap Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_5.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_5
{
//Sortieren Sie folgende Liste mit Hilfe des Quick Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Quick Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_6.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_6
{
//Sortieren Sie folgende Liste mit Hilfe des Count Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Count Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_7.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_7
{
//Sortieren Sie folgende Liste mit Hilfe des Bogo Sort
public static List<int> NumberList = new List<int>(){ 5865, 2152, 9596, 1258, 6585, 3265, 4256, 9215, 3256, 8526, 1452, 6215, 1478, 9548, 7532, 1254, 6253, 4268, 8523, 9652, 4521, 8527, 5215, 4236, 7524, 1258, 1952, 6235, 6548, 7598, 9854, 8562, 3358, 5591, 6279, 3791, 7523, 9137, 8245, 6237, 8266, 1762, 2458, 6775, 6325, 6326, 8542, 6324, 5833};
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert mit Bogo Sort:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}

32
XX_Sorting/Exercise_8.cs Normal file
View File

@ -0,0 +1,32 @@
using System;
using System.IO;
using Microsoft.VisualBasic;
namespace Exercises_C_Sharp.XX_Sorting
{
class Exercise_8
{
//Sortieren Sie folgende Liste selbstständig, ohne die Methode Sort() zu verwenden
public static List<string> NumberList = new List<string>(){ "Dies", "ist", "ein", "wunderschöner", "Satz", "welcher", "tolle", "Wörter", "verwendet", "und", "ideal", "zum", "Sortieren", "ist", "achten", "Sie", "nur", "darauf", "dass", "die", "Wörter", "zum", "Schluss", "sauber", "alphabetisch", "geordnet", "sind", "denn", "wie", "es", "ja", "so", "schön", "heißt", "Ordnung", "ist", "das", "halbe", "Leben" };
public static void Start()
{
Console.WriteLine("Alte Reihe:");
foreach(var element in NumberList)
Console.Write(element + " - ");
Console.WriteLine();
Console.WriteLine();
Console.WriteLine("Sortiert:");
//Code Start
//Code ENDE
foreach(var element in NumberList)
Console.Write(element + " - ");
}
//Code Start
//Code ENDE
}
}