Commit Graph

2192 Commits

Author SHA1 Message Date
Harshil Darji
f5c73a6f26 initial 2016-09-06 17:53:48 +05:30
Chetan Kaushik
5a14f2c9c5 Merge pull request #26 from yyeltsyn/patch-4
Update insertion_sort.py
2016-09-05 14:39:29 +05:30
yyeltsyn
a681b24f69 Update insertion_sort.py
Cleaner solution: shorter, less variables, straightforward logic.
2016-09-05 10:08:04 +03:00
Chetan Kaushik
df271bf2d0 Merge pull request #25 from yyeltsyn/patch-3
Update heap_sort.py
2016-09-02 20:15:39 +05:30
yyeltsyn
bb70803c9e Update heap_sort.py 2016-09-02 13:59:46 +03:00
Chetan Kaushik
ba37aef219 Merge pull request #24 from michaalbert/patch-1
Fixed typo in linear_search.py
2016-08-31 07:02:19 +05:30
NotAName
7bdcd08996 Fixed typo in linear_search.py
The documentation comment said "binary search", not "linear search"
2016-08-30 21:06:49 +02:00
Chetan Kaushik
8e98649dc7 Merge pull request #23 from yyeltsyn/patch-2
Update quick_sort.py
2016-08-29 21:53:21 +05:30
yyeltsyn
66433a5f0b Update quick_sort.py
Streamlining quick_sort function
2016-08-29 11:29:49 +03:00
Anup Kumar Panwar
a04d5c5e1e Revert "Update bubble_sort.py" 2016-08-26 17:16:03 +05:30
Chetan Kaushik
abd9d78a62 Merge pull request #22 from yyeltsyn/patch-1
Update bubble_sort.py
2016-08-26 17:13:58 +05:30
yyeltsyn
ab8340cac7 Update bubble_sort.py 2016-08-26 09:02:54 +03:00
Harshil Darji
456995580b Initial 2016-08-23 17:51:04 +05:30
Chetan Kaushik
de17460b24 Merge pull request #20 from Knhash/patch-1
Update README.md
2016-08-19 20:06:30 +05:30
Shashank S
2b34ad58fc Update README.md
- Add Binary Search description
- Change formatting to be consistent
2016-08-19 19:58:00 +05:30
Harshil Darji
22a4f26cf6 initial 2016-08-18 18:29:10 +05:30
Harshil Darji
42e9b09fa4 fixed shell_sort 2016-08-17 17:21:40 +05:30
Harshil Darji
ca78a8a9af fixed heap_sort 2016-08-17 17:18:11 +05:30
Harshil
f18d6dd92a Merge pull request #19 from JakeBonek/master
Added Shell Sort
2016-08-17 17:11:28 +05:30
JakeBonek
d31387455e Fixed spacing 2016-08-16 16:03:02 -04:00
JakeBonek
9e031e9783 Fixed spacing 2016-08-16 15:56:06 -04:00
JakeBonek
de8c5cbf00 Fixed typos 2016-08-16 12:56:38 -04:00
JakeBonek
e359b6efd4 Fixed typos and added the shell sort algorithm 2016-08-16 12:43:02 -04:00
Jacob Bonek
8a4b33534e Added Shell sort to readme 2016-08-15 23:18:42 -04:00
Chetan Kaushik
95ff389773 Added Linear Search Readme 2016-08-15 13:39:01 +05:30
Harshil
9b9e4cdc7c Merge pull request #18 from arijit-pande/master
added implementation for heap sort algorithm
2016-08-14 17:52:45 +05:30
Harshil Darji
45af05b1af improvement 2016-08-14 17:43:32 +05:30
arijit pande
7ce559ecdd added __future__ module 2016-08-14 10:04:21 +00:00
arijit pande
04d15692a8 added implementation for heap sort algorithm 2016-08-14 09:51:52 +00:00
Anup Kumar Panwar
8d5be8a436 Tower of Hanoi 2016-08-14 14:27:27 +05:30
Harshil Darji
cf295c39de Merge branch 'master' of https://github.com/TheAlgorithms/Python 2016-08-14 12:18:52 +05:30
Harshil Darji
4e3ff7c8e2 Initial 2016-08-14 12:18:30 +05:30
Harshil
398a6e2e11 Update README.md 2016-08-14 01:00:20 +05:30
Harshil
ddec3085ae Update README.md 2016-08-14 00:51:17 +05:30
Chetan Kaushik
b8df19ddea Merge pull request #17 from Knhash/patch-1
Update README.md : Selection Sort
2016-08-13 20:05:24 +05:30
Shashank S
1963a59622 Update README.md
Add description for Selection Sort
2016-08-13 20:01:22 +05:30
Chetan Kaushik
e3c24fe59a Merge pull request #16 from miczal/master
[Quicksort]Added shuffling of input
2016-08-13 15:00:56 +05:30
miczal
78402c5f42 [Quicksort]Added shuffling of input 2016-08-11 20:02:06 +02:00
Harshil Darji
e51406583c Initial 2016-08-11 19:13:33 +05:30
Harshil Darji
1376e3c3b9 Initial 2016-08-11 18:14:46 +05:30
Harshil Darji
ffc2c6327b Merge branch 'master' of https://github.com/TheAlgorithms/Python 2016-08-07 21:19:26 +05:30
Harshil Darji
cf8191130d Initial 2016-08-07 21:18:46 +05:30
Harshil
c1e69553ca Merge pull request #15 from naveenarun/patch-1
Create bogosort.py
2016-08-04 23:59:50 +05:30
Naveen Arunachalam
a2d2e4d6b5 Fix typo in documentation 2016-08-04 11:16:55 -07:00
Naveen Arunachalam
976e81f88d Create bogosort.py
Bogosort randomly sorts a list until it is sorted. Its computational complexity has a best case of O(n) and a worst case of O(n!).
2016-08-04 11:07:45 -07:00
Harshil Darji
c55eb1d082 Change .travis.yml 2016-08-03 00:42:39 +05:30
Harshil Darji
21a348f0b0 Improvement 2016-08-02 23:44:38 +05:30
Harshil Darji
f68690f296 Added test cases 2016-08-02 23:16:55 +05:30
Harshil
525b945446 Update README.md 2016-08-02 21:08:33 +05:30
Harshil Darji
052bcb1f52 Initial 2016-08-02 21:03:29 +05:30