docs: update languages index (#424)
Co-authored-by: Ming Tsai <37890026+ming-tsai@users.noreply.github.com>pull/430/head
parent
31418cd9d4
commit
5c059418b7
|
@ -5,9 +5,9 @@
|
||||||
- [Unique Elements in an array](arrays/unique-elements-in-an-array.c)
|
- [Unique Elements in an array](arrays/unique-elements-in-an-array.c)
|
||||||
|
|
||||||
## Bit Manipulation
|
## Bit Manipulation
|
||||||
- [Add and Subtract](bit-manipulation/add-and-sub-bitwise)
|
- [Add and Subtract](bit-manipulation/add-and-sub-bitwise.c)
|
||||||
- [Multiply](bit-manipulation/multiply-bitwise)
|
- [Multiply](bit-manipulation/multiply-bitwise.c)
|
||||||
- [divide](bit-manipulation/divide-bitwise)
|
- [Divide bitwise](bit-manipulation/divide-bitwise.c)
|
||||||
|
|
||||||
## Graphs
|
## Graphs
|
||||||
- [Prim's Algorithm](graphs/Prim's-algorithm.c)
|
- [Prim's Algorithm](graphs/Prim's-algorithm.c)
|
||||||
|
|
|
@ -18,12 +18,12 @@
|
||||||
|
|
||||||
1. [Longest Common Subsequence](Dynamic-Programming/longest-common-subsequence.cpp)
|
1. [Longest Common Subsequence](Dynamic-Programming/longest-common-subsequence.cpp)
|
||||||
2. [Longest Common Substring](Dynamic-Programming/longest-common-substring.cpp)
|
2. [Longest Common Substring](Dynamic-Programming/longest-common-substring.cpp)
|
||||||
3. [0/1-knapsack](Dynamic-Programming/01-knapsack-bottom-up.cpp)
|
3. [0/1-knapsack](Dynamic-Programming/01-knapsack.cpp)
|
||||||
4. [Matrix chain Multiplication](Dynamic-Programming/matrix-chain-multiplication.cpp)
|
4. [Matrix chain Multiplication](Dynamic-Programming/matrix-chain-multiplication.cpp)
|
||||||
|
|
||||||
## Graphs
|
## Graphs
|
||||||
|
|
||||||
1. [Bellman Ford Algorithm](Graphs/bellmam-ford.cpp)
|
1. [Bellman Ford Algorithm](Graphs/bellman-ford.cpp)
|
||||||
2. [kruskal Algorithm](Graphs/kruskal-algorithm.cpp)
|
2. [kruskal Algorithm](Graphs/kruskal-algorithm.cpp)
|
||||||
3. [Breadth First Search](Graphs/breadth-first-search.cpp)
|
3. [Breadth First Search](Graphs/breadth-first-search.cpp)
|
||||||
4. [Topological sort](Graphs/topological-sort.cpp)
|
4. [Topological sort](Graphs/topological-sort.cpp)
|
||||||
|
|
|
@ -14,4 +14,8 @@
|
||||||
## Sorting
|
## Sorting
|
||||||
1. [Bubble Sort](sorting/bubble-sort.go)
|
1. [Bubble Sort](sorting/bubble-sort.go)
|
||||||
2. [Insertion Sort](sorting/insertion-sort.go)
|
2. [Insertion Sort](sorting/insertion-sort.go)
|
||||||
3. [Quicksort](sorting/quicksort.go)
|
3. [Quicksort](sorting/quicksort.go)
|
||||||
|
|
||||||
|
## Recursion
|
||||||
|
1. [Fibonacci](recursion/fibonacci.go)
|
||||||
|
|
||||||
|
|
|
@ -4,8 +4,8 @@
|
||||||
1. [Counting Inversions](src/arrays/counting-inversions.js)
|
1. [Counting Inversions](src/arrays/counting-inversions.js)
|
||||||
|
|
||||||
## Linked Lists
|
## Linked Lists
|
||||||
1. [Singly](lsrc/inked_lists/singly.js)
|
1. [Singly](src/linked-lists/singly.js)
|
||||||
1. [Doubly](lsrc/inked_lists/doubly.js)
|
1. [Doubly](src/linked-lists/doubly.js)
|
||||||
|
|
||||||
|
|
||||||
## Searching
|
## Searching
|
||||||
|
|
|
@ -40,7 +40,7 @@
|
||||||
4. [Quicksort](sorting/quicksort.py)
|
4. [Quicksort](sorting/quicksort.py)
|
||||||
5. [Selection Sort](sorting/selection_sort.py)
|
5. [Selection Sort](sorting/selection_sort.py)
|
||||||
6. [Heap Sort](sorting/heap-sort.py)
|
6. [Heap Sort](sorting/heap-sort.py)
|
||||||
7. [Radix Sort](sorting/radix-sort.py)
|
7. [Radix Sort](sorting/radix_sort.py)
|
||||||
8. [Shell Sort](sorting/shell-sort.py)
|
8. [Shell Sort](sorting/shell-sort.py)
|
||||||
9. [Merge sort](sorting/merge_sort.py)
|
9. [Merge sort](sorting/merge_sort.py)
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue