Python Implementation of Sorting Algorithms
sbshah97 opened this issue · comments
Salman Shah commented
Ground rules:
- Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
- Pull Requests sent without claiming and referencing the Issue will not be entertained.
- Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
Kindly claim for the following Sorting Algorithms:
- Selection Sort
- Bubble Sort
- Merge Sort
- Quick Sort
- Shell Sort
- Topological Sort
Mridul Gupta commented
Hi, could you give specific details regarding what you require?
Tuhin Kundu commented
Please specify programs do you want to be implemented into python?
Richa commented
I want to start on this.
Salman Shah commented
Go ahead. Make sure you write the Algorithms in python 2.7
Tuhin Kundu commented
Working on Quick sort in python.
Adrià Ferré Grau commented
I would like to do the merge sort. Thank you.
Salman Shah commented
Cool go ahead @TuhinKundu @adriaferre
Salman Shah commented
Issue has been created separately in the Issues
tab. Kindly take a look!