rafa leyva ruiz
c0033f92ad
Use local insertion sort (solves #334 ) ( #370 )
2018-10-02 14:16:56 +05:30
Harshil
8d3665b638
Merge pull request #347 from piyush-kgp/Hashes
...
Added SHA1 algorithm in hashes folder
2018-10-02 10:46:26 +02:00
ayush1208
ca99871b29
Update README.md
2018-10-02 12:25:16 +05:30
Kelvin Salton do Prado
d2e77b05ef
searches: add sentinel linear search algorithm
2018-10-02 00:08:42 -03:00
Kelvin Salton do Prado
f4a80fbfcb
comb_sort: fix typo and indentation
2018-10-01 23:46:47 -03:00
Kelvin Salton do Prado
5fb6b31ea9
Add comb sort algorithm
2018-10-01 23:43:25 -03:00
Robert Bergers
3dab8e03a4
Just emboldened text and standardized some formatting throughout the file.
...
modified: README.md
modified: README.md
modified: README.md
2018-09-29 22:21:41 -04:00
cclauss
3a77380ed3
Undefined name: import random in Onepad_Cipher.py ( #339 )
2018-09-28 09:47:28 +05:30
Anshul
73ae8f2dd9
merge sort average&worst case scenarios changed ( #340 )
2018-09-28 09:45:34 +05:30
piyush-kgp
59027e4bd5
Improved code documentation, removed uncalled function
2018-09-25 22:56:24 +05:30
Harshil
8051da33b6
Merge pull request #348 from ahelm/fix/newton_file_name
...
typo fix: renamed `NeutonMethod.py` to `NewtonMethod.py`
2018-09-25 16:21:56 +02:00
Anton Helm
b62a258f8a
renamed NeutonMethod.py to NewtonMethod.py
2018-09-25 15:12:16 +01:00
piyush-kgp
965fdee22d
SHA1 class completed, Test passed
2018-09-25 19:21:29 +05:30
piyush-kgp
7f3895cdaf
moved constants inside the class
2018-09-23 19:44:37 +05:30
piyush-kgp
4d255f4e9f
SHA1 skeleton code
2018-09-23 05:25:07 +05:30
HasanGokdag
ce3e6787f4
merge sort average&worst case scenarios changed
2018-09-13 13:17:36 +02:00
Christian Bender
3ea683a6b9
Merge pull request #331 from bharath-123/patch-2
...
Thanks for contributing
2018-07-23 21:34:14 +02:00
bharath-123
dc5e42adf4
Merge branch 'master' into patch-2
2018-07-23 14:20:18 +05:30
bharath-123
bd7054ace9
updated testcase
...
Changed name to __name__. Sorry for the typo!
2018-07-23 13:01:02 +05:30
Christian Bender
6da7becf5a
Merge pull request #330 from bharath-123/patch-1
...
Added test case to knapsack.py
2018-07-23 00:07:27 +02:00
bharath-123
a9f9062080
Added code for memory function implementation
...
Added a function which implements knapsack using memory functions. Also I updated the test cases to include test cases for the memory function implementation.
2018-07-23 00:36:53 +05:30
bharath-123
d96048a7df
Updated test case
...
Made a typo writing name instead of __name__
2018-07-23 00:29:40 +05:30
bharath-123
2f22ea1acd
Added test case
...
Added a test case check knapsack.py
2018-07-23 00:18:58 +05:30
Christian Bender
9faaebcc80
Merge pull request #323 from Wayde2014/master
...
typo: strip
2018-07-22 18:09:00 +02:00
Christian Bender
ae5148962d
Merge pull request #316 from AnshulMalik/segment-tree-refactor
...
refactor-segment-tree
2018-07-22 18:04:58 +02:00
Christian Bender
ee92291249
Merge pull request #325 from cclauss/patch-5
...
Properly define raw_input() in Python 3
2018-07-16 23:54:06 +02:00
Christian Bender
2ca8d16af0
Merge pull request #324 from cclauss/patch-3
...
print() is a function in Python 3
2018-07-16 23:52:44 +02:00
cclauss
bec160c6dc
Use strip() to deal with leading or trailing whitespace
2018-07-03 08:33:38 +02:00
cclauss
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
cclauss
d4594da532
print() is a function in Python 3
2018-07-02 10:07:25 +02:00
PandllCom
ac30a97e99
typo: strip
2018-06-26 10:55:21 +08:00
Harshil
d4b4b7ba35
Merge pull request #321 from aldokkani/master
...
Break if the collection is sorted
2018-06-25 23:38:44 +02:00
Hossam Al-Dokkani
9489e8512d
Break if the collection is sorted
2018-06-23 17:01:06 +02:00
Harshil
cb6c82cb0f
Merge pull request #318 from psyas/master
...
Create new cipher - Elgamal cipher key generator
2018-06-13 15:52:18 +02:00
psyas
0c8707d11c
Elgamal cipher key generator code - (initial)
2018-06-12 21:21:38 +09:00
psyas
602eae756e
Elgamal cipher key generator code - (initial)
2018-06-12 21:18:50 +09:00
psyas
cc51a667e1
modify README.md by psyas for just test
2018-06-12 14:58:06 +09:00
Anshul Malik
0d19edbcb3
refactor-segment-tree
2018-06-05 21:39:16 +05:30
Harshil
16cd42c26c
Updated sol2.py to make it work as expected
2018-06-03 12:47:36 +02:00
Harshil
8727246ed7
Merge pull request #304 from hytae1993/master
...
quicksort_3_partition
2018-05-28 23:35:13 +02:00
Harshil
31f968f589
small change!
2018-05-28 23:34:21 +02:00
Harshil
192ba078dc
Merge pull request #305 from PyDevthon/patch-1
...
Updated_caesar_cipher.py
2018-05-28 23:26:03 +02:00
Harshil
13617225ca
small improvements!
2018-05-28 23:25:48 +02:00
PyDevthon
f1fe458356
Updated_caesar_cipher.py
...
Updated
2018-05-28 19:16:02 +05:30
Hyuntae
ca7eb46756
quicksort_3_partition
2018-05-28 19:19:15 +09:00
Christian Bender
2e74c8edf0
Merge pull request #301 from yesIamHasi/patch-6
...
Create merge_sort_fastest.py
2018-05-21 16:38:35 +02:00
Harshil
71fd719ab7
Update merge_sort_fastest.py
2018-05-21 10:28:37 +02:00
Harshil
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
Harshil
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
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
