218 Commits

Author SHA1 Message Date
7228d3b64c Merge pull request #89 from Prakash2403/master
Added Gradient Descent Algorithm
2017-06-26 17:55:58 +05:30
95fcfde105 Merge pull request #88 from zach-wild/topological_sort
Add topological_sort.py
2017-06-26 17:55:31 +05:30
=
64d29ef2ad -Added Gradient Descent Algorithm 2017-06-23 02:09:42 +05:30
16b0d62f28 Add topological_sort.py 2017-06-21 19:11:31 -04:00
7e35a83bf3 Merge pull request #84 from frmatias/master
Add Binary Search Tree in data_structures
2017-06-21 12:37:34 +05:30
1ce58efe1f With example 2017-06-21 00:44:26 -03:00
e74b99515b Merge pull request #86 from frmatias/patch-2
Update .travis.yml
2017-06-21 08:59:47 +05:30
c313a7bb4f Update .travis.yml 2017-06-20 22:08:03 -03:00
0e02818cc2 Update .travis.yml 2017-06-20 22:00:14 -03:00
194bd43bff Update .travis.yml 2017-06-20 12:13:10 -03:00
6998aa0875 Update .travis.yml 2017-06-20 12:12:10 -03:00
7aa8893da9 Update .travis.yml 2017-06-20 11:58:45 -03:00
da414d89d9 fixed error 2017-06-20 04:43:00 -03:00
8c9d9498b5 print 2017-06-20 04:17:20 -03:00
4a9405e1b0 Add Binary Search Tree in data_structures 2017-06-20 02:31:03 -03:00
65de84b0f1 Merge pull request #81 from gupta2140/master
Added feature for negative number input
2017-06-08 08:30:46 +05:30
4fe88f2f8e Added feature for negative number input 2017-06-07 23:41:44 +05:30
ef9082b468 Merge pull request #80 from gupta2140/master
Fixed infinite loop while entering, and preorder traversal.
2017-06-07 16:33:32 +05:30
c5fbb3e772 Fixed infinite loop while entering, and preorder traversal. 2017-06-07 15:50:53 +05:30
e268bf1b4d Merge pull request #75 from alaouimehdi1995/master
Fixing some terms number issue, and improving result for first terms (0 and 1)
2017-04-13 11:27:24 +05:30
ce8b025320 Adding spaces between operators 2017-04-12 14:45:56 +01:00
9a756d1940 Fixing some terms number issue, and improving result for first terms (0 and 1) 2017-04-11 23:10:52 +01:00
7814b28b79 Merge pull request #74 from alaouimehdi1995/master
Script Output: The entire longest increasing subsequence instead of it's length
2017-04-10 20:32:47 +05:30
08cbd113a4 Code optimized and complexity decreased 2017-04-10 13:49:01 +01:00
e01cf425bd Comments reviewed 2017-04-07 03:27:15 +01:00
628f184af5 The program returns now the longest increasing subsequence instead of returning only the length. Code optimized and well commented 2017-04-07 03:19:02 +01:00
408c5d0e80 Merge pull request #73 from alaouimehdi1995/master
More concise, optimized and readable code in sorts/quick_sort.py file
2017-04-06 17:40:29 +05:30
7ae9759220 Added some other spaces 2017-04-06 03:55:28 +01:00
8d06eb2c63 Added some space before and after operators 2017-04-06 03:44:47 +01:00
d1ac134973 Merge pull request #72 from ankit167/Heap_Data_Structure
Code for Heap data structure
2017-04-05 12:22:55 +05:30
183df6889b Code more concise and more readable 2017-04-05 06:58:16 +01:00
fa1e65ee0f Fixing print statement 2017-04-01 21:28:12 +05:30
e15c0aacc9 Contributing code for Heap data structure, and
all basic operations associated with it.
2017-04-01 21:16:11 +05:30
8fe29ffaa2 Merge pull request #70 from SylvainDe/master
Add most recent Python versions in Travis CI
2017-03-07 08:37:24 +05:30
52f71d933b Add most recent Python versions in Travis CI
Add more recent Python versions including
development branches and nightly build.
2017-03-06 21:06:15 +01:00
1a434dd2d4 Merge pull request #69 from theycallmemac/patch-3
Create radix_sort.py
2017-02-25 20:54:40 +05:30
e823c55f62 Create radix_sort.py 2017-02-25 15:06:58 +00:00
94a30990e9 Merge pull request #68 from prateekiiest/patch-4
Create normal_distribution_QuickSort_README.md
2017-02-07 14:19:49 +05:30
f42a1b8fbc Create normal_distribution_QuickSort_README.md 2017-02-05 17:52:31 +05:30
13d74ed460 Merge pull request #67 from TheAlgorithms/revert-66-master
Revert "Update Normal Distribution QuickSort Readme"
2017-02-04 18:15:55 +05:30
ea36ef407b Revert "Update Normal Distribution QuickSort Readme" 2017-02-04 18:15:41 +05:30
04f13daf10 Merge pull request #66 from prateekiiest/master
Update Normal Distribution QuickSort Readme
2017-02-04 18:15:16 +05:30
a484b47cdf Update README.md 2017-02-04 15:06:49 +05:30
d4e35fb430 Create normal_distribution_QuickSort_README.md 2017-02-04 15:02:23 +05:30
c2b7ba3614 Delete normaldistribution_quicksort_README.md 2017-02-04 14:35:30 +05:30
ea52ca8ee0 Create normaldistribution_quicksort_README.md 2017-02-04 14:12:16 +05:30
f707513eea Rename randomquicksort.py to random_normaldistribution_quicksort.py 2017-02-04 13:59:48 +05:30
3040022f0b Create randomquicksort.py 2017-02-04 12:20:55 +05:30
bbd96ecc18 Merge pull request #65 from prateekiiest/patch-3
Create random_normaldistribution_quicksort.py
2017-02-03 22:44:31 +05:30
a3ab980816 random_normaldistribution_quicksort
This is for creating an algorithm implementing QuickSort Algorithm where the pivot element is chosen randomly between first and last elements of the array and the array elements are taken from a Standard Normal Distribution.

This is different from the ordinary quicksort in the sense, that it applies more to real life problems , where elements usually follow a normal distribution. Also the pivot is randomized to make it a more generic one.
2017-02-03 22:02:05 +05:30