672 Commits

Author SHA1 Message Date
bec160c6dc Use strip() to deal with leading or trailing whitespace 2018-07-03 08:33:38 +02:00
ee3b0f2e50 Properly define raw_input)( in Python 3
__raw_input()__ was removed in Python 3 in favor of __input()__.  This change ensure similar functioning in both Python 2 and Python 3.
2018-07-02 10:11:28 +02:00
d4b4b7ba35 Merge pull request #321 from aldokkani/master
Break if the collection is sorted
2018-06-25 23:38:44 +02:00
9489e8512d Break if the collection is sorted 2018-06-23 17:01:06 +02:00
cb6c82cb0f Merge pull request #318 from psyas/master
Create new cipher - Elgamal cipher key generator
2018-06-13 15:52:18 +02:00
0c8707d11c Elgamal cipher key generator code - (initial) 2018-06-12 21:21:38 +09:00
602eae756e Elgamal cipher key generator code - (initial) 2018-06-12 21:18:50 +09:00
cc51a667e1 modify README.md by psyas for just test 2018-06-12 14:58:06 +09:00
16cd42c26c Updated sol2.py to make it work as expected 2018-06-03 12:47:36 +02:00
8727246ed7 Merge pull request #304 from hytae1993/master
quicksort_3_partition
2018-05-28 23:35:13 +02:00
31f968f589 small change! 2018-05-28 23:34:21 +02:00
192ba078dc Merge pull request #305 from PyDevthon/patch-1
Updated_caesar_cipher.py
2018-05-28 23:26:03 +02:00
13617225ca small improvements! 2018-05-28 23:25:48 +02:00
f1fe458356 Updated_caesar_cipher.py
Updated
2018-05-28 19:16:02 +05:30
ca7eb46756 quicksort_3_partition 2018-05-28 19:19:15 +09:00
2e74c8edf0 Merge pull request #301 from yesIamHasi/patch-6
Create merge_sort_fastest.py
2018-05-21 16:38:35 +02:00
71fd719ab7 Update merge_sort_fastest.py 2018-05-21 10:28:37 +02:00
7f4b240d1a Update merge_sort_fastest.py
I have modified the code a little to make it work as expected!
2018-05-21 10:21:33 +02:00
8957cf7ea8 Removed empty lines (255-313)
Lines 255 to 313 were just empty, so removed those lines!
2018-05-21 10:01:44 +02:00
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
099caeb423 Merge pull request #300 from irokafetzaki/tabu
Tabu Search
2018-05-20 17:50:53 +02:00
2d360cd73e Merge pull request #298 from yesIamHasi/patch-5
Create Fischer-Yates_Shuffle.py
2018-05-20 17:49:55 +02:00
35110b6e44 Tabu Search 2018-05-20 02:27:01 +03:00
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
f51020780c Merge pull request #296 from shivg7706/master
added PE 11, 22, 24
2018-04-29 14:19:21 +02:00
515cf2e81a changes 2018-04-26 08:54:44 +05:30
ab9ee4064e adding 22 and 24 2018-04-26 08:53:17 +05:30
4b58a88732 another sol for 11 2018-04-26 08:49:55 +05:30
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
3562182542 Update sol2.py 2018-04-16 19:17:28 +05:30
dbfc220264 Merge pull request #294 from TheAlgorithms/documented_md5_hash
Documented md5 hash
2018-04-16 14:19:31 +02:00
0494d48f84 added a docstring 2018-04-16 14:18:23 +02:00
cfae621f46 I documented the md5 hash 2018-04-16 14:13:49 +02:00
060988b896 Merge pull request #293 from TheAlgorithms/changed_chaosmachine
added a option for termination the program
2018-04-16 13:43:41 +02:00
c1422ec99c fixed the assert statments 2018-04-16 13:42:44 +02:00
3a7e75f329 added a option for termination the program 2018-04-16 13:37:04 +02:00
621192998e basic client-server implementation 2018-04-16 06:56:53 +02:00
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
10b0a40b2e fixed solution 4 of problem 1 2018-04-15 23:52:45 +02:00
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
13ebdc35fd I fixed the sol3.py of problem 1 2018-04-15 23:29:21 +02:00
a2b540f736 Merge pull request #285 from yesIamHasi/patch-2
Create Onepad_Cipher.py
2018-04-13 22:11:49 +05:30
31e1913f36 Merge pull request #284 from yesIamHasi/patch-1
Create NewtonRaphsonMethod.py
2018-04-13 22:11:30 +05:30
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
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
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
18907e4a07 fix type error (except an int) in jumpmp_search line 7. 2018-04-13 09:56:40 +08:00
78beda5034 Merge pull request #282 from daniel-s-ingram/master
Solution to Problem 36
2018-04-03 17:59:02 +05:30
b172ec3841 Solution to Problem 52 2018-04-03 00:04:38 -04:00
6a8f1cf232 Solution to Problem 40 2018-04-02 23:46:28 -04:00