Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fresh pull request for sorting algorithms #26

Merged
merged 19 commits into from
Nov 27, 2020
Prev Previous commit
Next Next commit
Update SUMMARY.md
Ahel2000 authored Nov 25, 2020
commit 56bdd26a39dba33f241fd432f5c32bb8655b3d17
7 changes: 4 additions & 3 deletions src/SUMMARY.md
Original file line number Diff line number Diff line change
@@ -15,11 +15,12 @@
- [Sorting Algorithms](./SortingAlgorithms/README.md)
- [Quick Sort](./SortingAlgorithms/QuickSort.md)
- [Radix Sort](./SortingAlgorithms/RadixSort.md)
- [Insertion Sort](./SortingAlgorithms/InsertionSort/insertion.md)
- [Merge Sort](./SortingAlgorithms/MergeSort/merge.md)
- [Selection Sort](./SortingAlgorithms/SelectionSort/selection.md)
- [Backtracking](./Backtracking/Backtracking.md)
- [Pseudocode](./Backtracking/Pseudocode/Pseudocode.md)
- [Problems](./Backtracking/Problems/Problems.md)
- [Persistent Data Structure](./PersistentDS/README.md)
- [Persistent Segment Trees](./PersistentDS/persistentST.md)
- [Graph](./Graph/Graph.md)
- [Tree](./Graph/Tree/Tree.md)
- [Diameter](./Graph/Tree/Diameter/diameter.md)