Harshil
14b5ac625b
Update 3n+1.py
...
Removed SyntaxError on Line 16!
2018-11-04 15:54:17 +01:00
gerroo
a834326e0e
Added b16, b32, a85, abs, absMax, absMin
2018-11-03 12:08:13 -08:00
Harshil
b4e443aac1
Merge branch 'master' of https://github.com/TheAlgorithms/Python
2018-11-01 18:31:11 +01:00
Harshil
608a462965
Merge branch 'fix-singly_linked_list' of git://github.com/ashwek/Python-1 into ashwek-fix-singly_linked_list
2018-11-01 18:29:58 +01:00
Ashwek Swamy
f89d3a9ec3
Update singly_linked_list.py
2018-11-01 21:25:45 +05:30
Ashwek Swamy
48aa4c4a01
Update singly_linked_list.py
2018-11-01 21:04:05 +05:30
Ashwek Swamy
32db8be93e
Update FindMax.py ( #588 )
...
Issues in previous code:
`Line 3` math module is not used so we don't have to import it
`Line 5`, `max = 0` will give wrong answer (0) when the list contains only -ve elements, as 0 will always be larger than the elements.
2018-11-01 21:55:28 +08:00
Shivam Arora
11d0d641ad
Binary graph algorithms to find height of binary tree and to check whether the given binary tree is full binary or not
2018-10-31 17:28:49 +05:30
Shivam Arora
1a5df6bc46
Added the method to find the isolated nodes in the graph
2018-10-31 16:14:30 +05:30
Harshil
d8e33020b4
Merge branch 'master' of git://github.com/Satyam-Bhalla/Python into Satyam-Bhalla-master
2018-10-31 11:43:17 +01:00
Shivam Arora
506172279a
Addition and multiplication algorithm of two square matrix
2018-10-31 15:17:11 +05:30
Aditya Sharma
1b19028117
Update doubly_linked_list.py ( #545 )
2018-10-31 08:34:55 +01:00
Benedikt Werner
6db1994de2
Remove unnecessary loop in matrix_chain_order.py ( #564 )
2018-10-31 08:31:49 +01:00
K Yasaswi Sri Chandra Gandhi
3917015545
Improved Markdown in README ( #517 )
...
* Improved markdown in README
Added markdown for all special characters
* Improved Markdown in README
2018-10-31 08:29:32 +01:00
ankitjain4
459a4f35a5
Create factorial_python.py ( #530 )
...
* Create factorial_python.json
* Rename factorial_python.json to factorial_python.py
2018-10-31 08:28:41 +01:00
Harshil
8b37fc35b6
Merge branch 'dheerajreddymumma-master'
2018-10-31 08:24:36 +01:00
Harshil
fa4276d2c0
Merge branch 'master' of git://github.com/dheerajreddymumma/Python
2018-10-31 08:24:14 +01:00
Harshil
46b3ebd966
Merge branch 'master' of git://github.com/dheerajreddymumma/Python into dheerajreddymumma-master
2018-10-31 08:23:55 +01:00
Harshil
485f93fc26
Merge branch 'master' of git://github.com/gerroo/Python
2018-10-31 08:19:15 +01:00
K Yasaswi Sri Chandra Gandhi
432c62d09e
Improved README and added Exclusive Disjunction Operator ( #516 )
...
Removed the Wikipedia reference links, wrote code for the Exclusive Disjunction Operator and added link for Heap Sort Wikipedia page
2018-10-30 15:45:37 +01:00
Hrushikesh Hanbar
f1ec84af84
Update balanced_parentheses.py ( #538 )
2018-10-30 15:29:12 +01:00
Harshil
82291c21ad
Merge branch 'master' into master
2018-10-30 15:12:23 +01:00
Harshil
5492681630
Update client.py
2018-10-30 14:59:46 +01:00
Kushal Naidu
75d11f9034
Correctly check for squares of primes ( #549 )
...
As the for-loop was looping by two numbers, it would stop at 1 number less than the root of prime squares, resulting it in incorrectly classifying the squares as prime numbers. Incrementing the loop ensures the next number is also considered resulting in accurate classification.
2018-10-30 14:38:44 +01:00
TobiDueces
fa86d3d954
Add Jump Search image ( #552 )
...
* Add Jump Search image
* Update README.md
2018-10-29 18:23:24 +01:00
TobiDueces
cf31efb53f
Update README.md ( #553 )
2018-10-29 18:12:00 +01:00
gerroo
fde422e217
base64
...
added b64
2018-10-28 13:36:51 -08:00
gerroo
261d721b22
name = main
...
added if __name__ == '__main__'
2018-10-28 13:36:39 -08:00
gerroo
9ded2c3d22
Modified simple_client
...
Now it's more descriptive
2018-10-28 13:24:41 -08:00
gerroo
991abb2402
Added findMin
2018-10-28 13:23:29 -08:00
gerroo
dd8e2afae6
Added 3n+1
2018-10-28 13:23:19 -08:00
dheerajreddymumma
1305e74b8a
New modified Python code for Prime check
2018-10-28 17:02:27 +05:30
dheerajreddymumma
2040757751
Optimized prime check code in Python.
2018-10-28 16:53:56 +05:30
Harshil
4e0184a41d
Update caesar_cipher.py
...
Removed unnecessary recursion and updated code!
2018-10-27 14:14:35 +02:00
Harshil
a84f7c073f
Rename segment_tree to segment_tree.py
2018-10-27 13:38:23 +02:00
Harshil
e1d1f8513d
Delete binary_seach_tree.py
...
I forgot that we already have an implementation of Binary Search! So deleting this one!
2018-10-27 13:36:30 +02:00
Harshil
f0af8320f7
Merge branch 'master' of git://github.com/AbhishekVarshney98/Python
2018-10-27 13:30:30 +02:00
Harshil
c787c13a71
Resolve conflicts
2018-10-27 13:29:53 +02:00
Ishmeet-Singh-Saggu
ce0a013ad7
Update bubble_sort.py ( #535 )
2018-10-27 13:21:44 +02:00
Satyam-Bhalla
49fc9a1aed
Random Forest Classification added
2018-10-27 08:12:16 +05:30
Satyam-Bhalla
349450b957
Random Forest Regression Added
2018-10-27 08:08:03 +05:30
Harshil
f0d5bc6ece
Merge branch 'improved_sorting_algo' of git://github.com/YasirChoudhary/Python
2018-10-26 17:25:36 +02:00
cclauss
3bab59ae06
LGTM: Start testing on Python 3 instead of Python 2 ( #510 )
...
* LGTM: Start testing on Python 3 instead of Python 2
Fixes : #492
* LGTM: Run flake8 tests in before_index
* Update .lgtm.yml
* Indentation
* python3 -m
* Try on Python 3.7 instead of 3.6
* LGTM: Run flake8 tests on Python 3.6
* Check version of flake8
* python3 -m pip install --upgrade --user flake8
* requirements: flake8
* Update .lgtm.yml
* Ready for review
* Update .lgtm.yml
* Force a retest
* Rebuild
2018-10-24 21:38:51 +02:00
Harshil
3fa8f7bc2f
Update logistic_regression.py
2018-10-24 21:20:28 +02:00
Harshil
2638d57c71
Update caesar_cipher.py
2018-10-24 21:13:42 +02:00
phineas0fog
471b3110d6
Update README.md ( #512 )
...
removed merge beacons ;)
2018-10-24 20:18:50 +02:00
Harshil
c7de76deda
Resovle conflicts
2018-10-24 20:12:10 +02:00
Harshil
ed11384116
Update sol2.py
2018-10-24 12:50:39 +02:00
AbhishekVarshney98
a50c6b4163
added sasslabel
2018-10-23 17:24:42 +05:30
Harshil
11480295d4
Merge branch 'NguyenU' of git://github.com/NguyenU/Python into NguyenU-NguyenU
2018-10-22 20:52:42 +02:00
