42 lines
1.3 KiB
Markdown
42 lines
1.3 KiB
Markdown
# C#
|
|
For running the `.cs` file please using [.Net Finddle](https://dotnetfiddle.net/)
|
|
|
|
## Arrays
|
|
1. [Single Number](src/Arrays/single-number.cs)
|
|
|
|
## Number Theory
|
|
1. [Big Mod Algorithm](src/Number-Theory/big-mod.cs)
|
|
2. [Sieve of Eratosthenes](src/Number-Theory/sieve-of-eratosthenes.cs)
|
|
3. [Bitwise Sieve of Eratosthenes](src/Number-Theory/bitwise-sieve-of-eratosthenes.cs)
|
|
|
|
|
|
## Sorts
|
|
|
|
1. [Bubble Sort](src/Sorts/bubble-sort.cs)
|
|
2. [Insertion Sort](src/Sorts/insertion-sort.cs)
|
|
3. [Selection Sort](src/Sorts/selection-sort.cs)
|
|
4. [Counting Sort](src/Sorts/counting-sort.cs)
|
|
5. [Merge Sort](src/Sorts/merge-sort.cs)
|
|
|
|
## Strings
|
|
- [Palindrome](src/Strings/palindrome.cs)
|
|
|
|
## Search
|
|
- [Binary Search](src/Search/binary-search.cs)
|
|
- [Linear Search](src/Search/linear-search.cs)
|
|
|
|
## Maths
|
|
- [Abundant Number](src/Maths/abundant-number.cs)
|
|
|
|
## Queues
|
|
- [Queue Implementation Using Two Stacks](src/Queues/queue-implementation-using-two-stacks.cs)
|
|
|
|
## Recursion
|
|
- [Factorial](src/Recursion/factorial.cs)
|
|
|
|
## Graph
|
|
- [Breadth First Search](src/Graph/breadth-first-search.cs)
|
|
- [Depth First Search](src/Graph/depth-first-search.cs)
|
|
- [Kruskals Algorithm to Find Minimum Spanning Tree](src/Graph/kruskals-algorithm.cs)
|
|
- [Dijkstras Algorithm to Find Shortest Path](src/Graph/dijkstra.cs)
|
|
- [Floyd Warshalls Algorithm to Find All Pair Shortest Path](src/Graph/floyd-warshall-algorithm.cs) |