Syed Haseeb Shah
237df47a31
Create merge_sort_fastest.py
...
Python implementation of merge sort algorithm.
Takes an average of 0.6 microseconds to sort a list of length 1000 items.
Best Case Scenario : O(n)
Worst Case Scenario : O(n)
2018-05-20 23:00:17 +05:00
Harshil
099caeb423
Merge pull request #300 from irokafetzaki/tabu
...
Tabu Search
2018-05-20 17:50:53 +02:00
Harshil
2d360cd73e
Merge pull request #298 from yesIamHasi/patch-5
...
Create Fischer-Yates_Shuffle.py
2018-05-20 17:49:55 +02:00
irokafetzaki
35110b6e44
Tabu Search
2018-05-20 02:27:01 +03:00
Syed Haseeb Shah
09088cd835
Create Fischer-Yates_Shuffle.py
...
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence.
For more details visit
wikipedia/Fischer-Yates-Shuffle
2018-05-19 16:07:24 +05:00
Christian Bender
f51020780c
Merge pull request #296 from shivg7706/master
...
added PE 11, 22, 24
2018-04-29 14:19:21 +02:00
shivg7706
515cf2e81a
changes
2018-04-26 08:54:44 +05:30
shivg7706
ab9ee4064e
adding 22 and 24
2018-04-26 08:53:17 +05:30
shivg7706
4b58a88732
another sol for 11
2018-04-26 08:49:55 +05:30
Harshil
5832340ac6
Merge pull request #295 from bp274/master
...
Modernize Python 2 code to work for Python 3
2018-04-17 00:52:00 +05:30
Bhaavik Pratyush
3562182542
Update sol2.py
2018-04-16 19:17:28 +05:30
Christian Bender
dbfc220264
Merge pull request #294 from TheAlgorithms/documented_md5_hash
...
Documented md5 hash
2018-04-16 14:19:31 +02:00
Christian Bender
0494d48f84
added a docstring
2018-04-16 14:18:23 +02:00
Christian Bender
cfae621f46
I documented the md5 hash
2018-04-16 14:13:49 +02:00
Christian Bender
060988b896
Merge pull request #293 from TheAlgorithms/changed_chaosmachine
...
added a option for termination the program
2018-04-16 13:43:41 +02:00
Christian Bender
c1422ec99c
fixed the assert statments
2018-04-16 13:42:44 +02:00
Christian Bender
3a7e75f329
added a option for termination the program
2018-04-16 13:37:04 +02:00
Harshil
621192998e
basic client-server implementation
2018-04-16 06:56:53 +02:00
Christian Bender
ca5c6f268a
Merge pull request #292 from TheAlgorithms/fixed_solv_4_problem1
...
fixed solution 4 of problem 1
2018-04-15 23:53:37 +02:00
Christian Bender
10b0a40b2e
fixed solution 4 of problem 1
2018-04-15 23:52:45 +02:00
Christian Bender
2c0de39287
Merge pull request #290 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 #285 from yesIamHasi/patch-2
...
Create Onepad_Cipher.py
2018-04-13 22:11:49 +05:30
Harshil
31e1913f36
Merge pull request #284 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 #283 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 #282 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 #281 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 #280 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 #279 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 #278 from daniel-s-ingram/master
...
Solution to Problem 21
2018-03-23 18:24:48 +05:30
Harshil
a2e615e6f8
Merge pull request #277 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 #276 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 #275 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 #274 from gabrielangelo/master
...
hash functions added
2018-03-21 09:09:32 +05:30
Harshil
6b60a6b53c
Merge pull request #273 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
