Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 8 additions & 9 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,12 +1,11 @@
# Algorithms

### All the algorithms you need!
All the algorithms you need!

##### 1. Stack using <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/stackarray.c">Array</url></a> and <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/stackll.c">Linked List</url></a>
##### 2. Queue using <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/queuearray.c">Array</url></a> and <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/queuell.c">Linked List</url></a>
##### 3. Sorting Algorithms: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/selection.c">Selection</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bubble.c">Bubble</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/insertion.c">Insertion</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/merge.c">Merge</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/quick.c">Quick</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/heap.c">Heap</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/counting.c">Counting</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/radix.c">Radix</a></url>
##### 4. Searching: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/lsearch.c">Linear</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/msearch.c">Multiple</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bsearch.c">Binary</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bfs.c">Breadth First</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/dfs.c">Depth First</a></url>
##### 5. Matrix: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/matmul.c">Matrix Multiplication </a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/matchain.c">Matrix Chain Multiplication </a></url>
##### 6. Tree: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bst.c">Binary Search Tree</url></a>
##### 7. Hash Table: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/lprobing.c">Linear Probing</url></a> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/schaining.c">Seperate Chaining</url></a>
#### More to come. :)
1. Stack using <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/stackarray.c">Array</url></a> and <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/stackll.c">Linked List</url></a>
2. Queue using <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/queuearray.c">Array</url></a> and <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/queuell.c">Linked List</url></a>
3. Sorting Algorithms: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/selection.c">Selection</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bubble.c">Bubble</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/insertion.c">Insertion</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/merge.c">Merge</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/quick.c">Quick</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/heap.c">Heap</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/counting.c">Counting</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/radix.c">Radix</a></url>
4. Searching: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/lsearch.c">Linear</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/msearch.c">Multiple</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bsearch.c">Binary</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bfs.c">Breadth First</a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/dfs.c">Depth First</a></url>
5. Matrix: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/matmul.c">Matrix Multiplication </a></url> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/matchain.c">Matrix Chain Multiplication </a></url>
6. Tree: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/bst.c">Binary Search Tree</url></a>
7. Hash Table: <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/lprobing.c">Linear Probing</url></a> | <url><a href="https://github.com/paramsingh96/Algorithms/blob/master/source/schaining.c">Seperate Chaining</url></a>