Algorithms

This repository contains implementations of various algorithms in C#, providing practical examples and solutions for common algorithmic problems.

Contents

The repository encompasses a diverse set of algorithms implemented. Some of the key algorithms included are:

• String algorithms (e.g., String Reverse)
• Sorting algorithms (e.g., Bubble Sort, Quick Sort)
• Graph algorithms (e.g., Prim's Algorithm, Depth-First Search)

Structure

Algorithms
├── GraphAlgorithms
│ ├── Algorithms
│ │ ├── EulerPath.cs
│ │ ├── HamiltonPath.cs
│ │ ├── MaximumFlow.cs
│ │ └── PrimsAlgorithm.cs
│ └── GraphRepresentations
│   ├── GraphRepresentationBuilder.cs
│   ├── ReachabilityMatrixPathFinder.cs
│   └── TransposedReachabilityMatrixPathFinder.cs
├── Sorting
│ ├── Sorts
│ | ├── BubbleSort.cs
│ | ├── CocktailSort.cs
│ | ├── QuickSort.cs
│ | └── ShellSort.cs
│ ├── Utils
│ | └── ConditionUtility.cs
│ ├── ISort.cs
│ └── SortOrder.cs
├── Strings
│ ├── StringReverse.cs
│ └── Substrings.cs
└── Tests
  ├── Data
  │ ├── GraphsDataClass.cs
  │ └── SortingDataClass.cs
  ├── Graphs.cs
  ├── Sorting.cs
  └── Strings.cs

Usage

1. Clone the repository:

git clone https://github.com/VelSkorp/Algorithms.git

2. Open the solution in Visual Studio or other IDE.
3. Navigate to the desired algorithm directory.
4. Follow the instructions provided in the source file to understand and utilize the algorithm.

Contributing

Contributions to Algorithms are welcome! If you find any issues or have ideas for improvements, feel free to open an issue or submit a pull request on GitHub.

License

This project is licensed under the MIT License - see the LICENSE file for details.