Welcome to Sorting Algorithm repository. This repository is a small and handful collection of all sorting algorithms that needed most.
If you like this repository, you can bookmark this repo by hitting Star button above. This helps github search algorithm to show this repo to others.
- Bubble Sort
- Bucket Sort
- Counting Sort
- Cyclic Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Pigeonhole Sort
- Quick Sort
- Radix Sort
- Selection Sort
- Shell Sort
- Stalin Sort
- Binary Insertion Sort
Get a fork/copy of this repository by clicking on Fork button.
Clone it into your local PC by using
git clone https://github.com/Himanshu40/Sorting-Algorithm
After cloning this repository, move into this repository by using
cd Sorting-Algorithm/Add reference to this repository by using
git remote add src https://github.com/Himanshu40/Sorting-Algorithm
To see the changes, run the following command
git remote -v
Always make sure to update your local repository with this repository before making any changes.
git fetch --all
Switch to master branch
git checkout master
Merge all the remote commits to your master branch
git merge
Push changes to your forked Sorting-Algorithm repository
git push origin master
Now you are ready to start contributing and sending pull requests. See contributing guide.
- Data Structures and Algorithm Analysis in C by Mark Allen Weiss
- GeeksforGeeks
- Programiz
- Wikipedia
- LeetCode
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
