Note: Language Context
Please note that this project was written in German as part of my
Ausbildung(German vocational training). Therefore, all variable names, comments, and package/class names are in German.
This repository is a collection of classic "Data Structures and Algorithms" (DSA) exercises, all grouped under the datenstrukturen package.
It includes several distinct components, each demonstrating a core Computer Science concept. The DatenStrukturen.java file acts as a main class to test and demonstrate all the other utilities.
A dictionary class that provides two-way (EN <-> DE) translations.
- Core Concept: Uses two
HashMaps (englishToGermanandgermanToEnglish) to provide fast, O(1) lookups in both directions. addWord()andremoveWord()methods correctly update both maps to keep them synchronized.
A static utility class that performs mathematical set operations.
- Core Concept: Demonstrates a clear understanding of
java.util.Setand its built-in methods. getUnion(A, B): ImplementsA ∪ B(Birleşim) usingaddAll().getIntersection(A, B): ImplementsA ∩ B(Kesişim) usingretainAll().getDifference(A, B): ImplementsA \ B(Fark) usingremoveAll().
A class that implements a classic sorting algorithm.
- Core Concept: Demonstrates the Bubble Sort algorithm (
buubleSortLis) by implementing it from scratch using nestedforloops to sort aList<Integer>.