Commit Graph

3384 Commits

Author SHA1 Message Date
Christian Bender
10b0a40b2e fixed solution 4 of problem 1 2018-04-15 23:52:45 +02:00
Christian Bender
2c0de39287
Merge pull request from TheAlgorithms/fixed_sol3_problem1
I fixed the sol3.py of problem 1
2018-04-15 23:31:18 +02:00
Christian Bender
13ebdc35fd I fixed the sol3.py of problem 1 2018-04-15 23:29:21 +02:00
Harshil
a2b540f736
Merge pull request from yesIamHasi/patch-2
Create Onepad_Cipher.py
2018-04-13 22:11:49 +05:30
Harshil
31e1913f36
Merge pull request from yesIamHasi/patch-1
Create NewtonRaphsonMethod.py
2018-04-13 22:11:30 +05:30
Syed Haseeb Shah
0fdd2d369e
Create Onepad_Cipher.py
In one pad algorithm length of key and length of message are equal which results in endless possibilities of false messages on bruteforce.
2018-04-13 20:49:38 +05:00
Syed Haseeb Shah
3a0555bdd7
Create NewtonRaphsonMethod.py
Newton-Raphson method is non bracketing iterative algorithm to find the nearest root of an equation from point 'a'. It's much faster because convergence to the real root is very much faster than any other methods.
2018-04-13 20:25:47 +05:00
Christian Bender
0a1b6ad4cf
Merge pull request from clobob/master
fix type error (except an int) in jumpmp_search line 7.
2018-04-13 15:36:36 +02:00
douly
18907e4a07 fix type error (except an int) in jumpmp_search line 7. 2018-04-13 09:56:40 +08:00
Harshil
78beda5034
Merge pull request from daniel-s-ingram/master
Solution to Problem 36
2018-04-03 17:59:02 +05:30
Daniel Ingram
b172ec3841 Solution to Problem 52 2018-04-03 00:04:38 -04:00
Daniel Ingram
6a8f1cf232 Solution to Problem 40 2018-04-02 23:46:28 -04:00
Daniel Ingram
9ed60ba882 Solution to Problem 36 2018-04-02 12:20:53 -04:00
Christian Bender
cf1447334e
Merge pull request from daniel-s-ingram/master
Thanks for contribution
2018-03-30 21:36:17 +02:00
Daniel Ingram
53d9989b13 Solution to Problem 12 2018-03-28 19:11:14 -04:00
Harshil
b4cbf5ddd8
Merge pull request from daniel-s-ingram/master
Solution to Problem 19
2018-03-26 09:23:46 +05:30
Daniel Ingram
7b1b33a60a Solution to Problem 19 2018-03-25 23:14:59 -04:00
Harshil
9319981067
Merge pull request from daniel-s-ingram/master
Solution to Problem 53
2018-03-26 07:07:40 +05:30
Daniel Ingram
eb40f43650 Solution to Problem 53 2018-03-24 21:48:48 -04:00
Harshil
4045f05b6b
Merge pull request from daniel-s-ingram/master
Solution to Problem 21
2018-03-23 18:24:48 +05:30
Harshil
a2e615e6f8
Merge pull request from girijamanojkumarreddy/master
Added a Solution using Euclidean Algo
2018-03-23 18:24:09 +05:30
girijamanojkumarreddy
f538ea51dc Added General solution for Problem 9 2018-03-23 16:27:25 +05:30
Daniel Ingram
68e5bb4804 Solution to Problem 76 2018-03-22 12:09:45 -04:00
Daniel Ingram
570c27cfdd Solution to Problem 21 2018-03-22 11:27:50 -04:00
girijamanojkumarreddy
49a33969e6 Added a Solution using Euclidean Algo 2018-03-22 19:29:44 +05:30
Harshil
5f1ab6b68e
Merge pull request from daniel-s-ingram/master
Counting integer partitions
2018-03-22 19:11:23 +05:30
Daniel Ingram
888c51b9d2 Counting integer partitions 2018-03-22 09:33:54 -04:00
Harshil
92cbe09308
Merge pull request from girijamanojkumarreddy/master
Added Solution to Problem 2 in a simple approach
2018-03-22 16:17:14 +05:30
GirijaManoj kumar reddy Kalakoti
1ead4e0f2d
Added Solution to Problem 2 in a simple approach 2018-03-22 15:50:49 +05:30
Harshil
fc3bdb6e12
Merge pull request from gabrielangelo/master
hash functions added
2018-03-21 09:09:32 +05:30
Harshil
6b60a6b53c
Merge pull request from daniel-s-ingram/master
Algorithm for transforming one string into another in the most cost-efficient way
2018-03-21 09:08:08 +05:30
Daniel Ingram
070ebb3afc Merge branch 'master' of https://github.com/daniel-s-ingram/PythonAlgorithms 2018-03-20 20:24:27 -04:00
Daniel Ingram
a5f0ae84ea Solution to Problem 22 2018-03-20 20:23:51 -04:00
gabriel
1fa23f57d7 hash functions added 2018-03-20 20:48:58 -03:00
Daniel Ingram
0deb227705
Update min-cost-string-conversion.py 2018-03-20 18:50:55 -04:00
Daniel Ingram
6abab54c2b Minimum cost for transformation from one string to another using basic operations 2018-03-20 18:49:47 -04:00
Daniel Ingram
a753acf1de Computes minimum cost for converting one string into another 2018-03-20 15:23:09 -04:00
Harshil
c461b34b2b
Merge pull request from daniel-s-ingram/master
Fixed xrange compatibility for Python 3
2018-03-19 21:20:37 +05:30
Daniel Ingram
a872085183 Merge branch 'master' of https://github.com/daniel-s-ingram/PythonAlgorithms 2018-03-19 11:27:12 -04:00
Daniel Ingram
924d0a0552 Added xrange compatibility for Python 3 2018-03-19 11:26:47 -04:00
Daniel Ingram
7ee262e514
Merge branch 'master' into master 2018-03-19 10:11:24 -04:00
Daniel Ingram
a4cd8978b4 Solution to Problem 11 2018-03-19 10:10:10 -04:00
Daniel Ingram
c6c5d62311 Fixed xrange compatibility for Python 3 2018-03-19 09:29:46 -04:00
Harshil
3899f9b507
Merge pull request from cclauss/patch-6
from __future__ import print_function For Python 3
2018-03-19 09:00:46 +05:30
Harshil
5e21232e82
Merge pull request from cclauss/patch-5
xrange() was removed in Python 3 in favor of range()
2018-03-19 09:00:22 +05:30
Harshil
92484f26af
Merge pull request from cclauss/patch-3
Fix Python 2 syntax error in matrix_chain_order.py
2018-03-19 08:59:21 +05:30
Harshil
395fa638f0
Merge pull request from daniel-s-ingram/master
Solution to Problem 48
2018-03-19 08:58:42 +05:30
cclauss
4fd777e3b4
Update SimpsonRule.py 2018-03-19 03:28:00 +01:00
cclauss
3615322790
from __future__ import print_function for Python 3
@ltdouthit __print()__ is a function in Python 3
2018-03-19 03:27:22 +01:00
cclauss
0516bde45f
from __future__ import print_function For Python 3
@ltdouthit __print()__ is a function in Python 3
2018-03-19 03:25:29 +01:00