Commit Graph

3426 Commits

Author SHA1 Message Date
S. Sharma
2bbf8cd109 Added extended euclidean algorithm (#720)
* Added extended euclidean algorithm

* Fixed extended euclidean algorithm
2019-02-27 22:28:59 +08:00
Reshad Hasan
9a44eb4479 Organize graph algorithms (#719)
* organized graph algorithms

* all graph algorithms in Graphs/ folder

* all graph algorithms are in one folder

* Rename number theory/factorial_python.py to maths/factorial_python.py
2019-02-25 17:35:24 +08:00
Reshad Hasan
e6e5f4b301 Added naive string search algorithm (#715) 2019-02-23 22:18:21 +08:00
Sravan Kumar Vinakota
2b27086c00 Added hill_cipher.py (#696)
A python class that implements the Hill cipher algorithm.
2019-02-22 00:19:28 +08:00
Sanders Lin
74e94ab5e2 Create project Euler problem 25 sol2.py (#658) 2019-02-21 00:57:48 +08:00
pradyotd
98a149e41e Update coin_change.py (#706)
Cleanup PEP-8 , additional comments , using coin_val, instead of range and index.
2019-02-21 00:54:26 +08:00
Abhi Kampurath
ad68eed73e Update caesar_cipher.py (#702) 2019-02-19 23:26:09 +08:00
Reshad Hasan
af08a67b20 added the dijkstra algorithm (#704) 2019-02-18 23:35:46 +08:00
Vivek
6f283336ae Adding function for actual level order traversal (#699) 2019-02-17 00:16:43 +08:00
gpapadok
301493094e Update absMax.py (#602)
* Update absMax.py

Fixed two bugs

* changed to abs instead of absVal
2019-02-16 00:01:10 +08:00
Sanders Lin
3c8036432c Project Euler problem 6 solution 3 (#640) 2019-02-14 12:08:21 +08:00
Sanders Lin
9417091dab Update sol1.py (#643)
small off by one error. Boundary condition: if len(number) =13 , we would need to check exactly 1 combination, namely number itself. However  for i in range(len(number)-13): will iterate 0 times.
2019-02-13 18:02:32 +08:00
Sanders Lin
60418a6fd7 Create project Euler problem 8 sol2.py (#644)
intuitive solution using functional programming
2019-02-13 14:55:48 +08:00
Sanders Lin
02155def00 Create project Euler problem 9 sol3.py (#645) 2019-02-13 00:40:05 +08:00
P-Shreyas-Shetty
02f850965d Implementation of Newton-Raphson method (#650)
Implemented Newton-Raphson method using pure python. Third party library is used only for visualizing error variation with each iteration.
2019-02-12 00:15:49 +08:00
Aruj Sharma
a0d5c9aaf0 Create BitonicSort.py (#386) 2019-02-11 17:53:49 +08:00
Harshit Kumar
1cbbd5fe1a Added BFS and DFS (graph algorithms) (#408)
* feat: Add Breadth First Search (graph algorithm)

* feat: Add Depth First Search (graph algorithm)
2019-02-11 17:52:14 +08:00
Sanders Lin
42d42c3136 Project Euler problem 4 sol 2 small fix (#632) 2019-02-11 10:42:43 +08:00
Sanders Lin
dbe3f062ad Project Euler Problem 14 Solution 2 (#651) 2019-02-10 02:00:05 +08:00
Sanders Lin
d689b4b083 Project Euler problem 7 solution 3 (#642) 2019-02-10 01:49:57 +08:00
Ethan Vieira
16e95a3de5 p2 sol2 fixed (#669) 2019-02-10 00:59:43 +08:00
Sanders Lin
8d4d95099f Project Euler problem 3 small fix (#631) 2019-02-10 00:35:52 +08:00
Anand Gaurav
4c14ad9dd6 minor update hacktoberfest (#466) 2019-02-09 09:30:10 +05:30
Anthony Marakis
dc302be505 Create rod_cutting.py (#373) 2019-02-09 08:27:23 +05:30
Inno Fang
17a6d1c1a7 Fix sorts/radix_sort (#338) 2019-02-09 07:44:23 +05:30
Gini5
faf16d7ced Add iteration version (#322) 2019-02-09 07:24:07 +05:30
Rizwan Hasan
c6be53e1c4 Rename Directed and Undirected (Weighted) Graph to Directed and Undirected (Weighted) Graph.py (#686) 2019-01-26 21:09:18 +08:00
Michael Fried
c92b02cfa3 Editing base64, Adding average file, Editing find_lcm (#673)
* avrage.py

calculate and print the avrage of number list.

* Update base64_cipher.py

encoding and decoding base64 without any module.

* Update and rename avrage.py to average.py

* update find_lcm algorithm

I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}).
2019-01-20 02:19:06 +05:30
Matheus Guimarães
ac28125060 Add median filter algorithm (#675) 2019-01-19 09:20:59 +05:30
Mickaël Schoentgen
2d70e9f747 Fix ResourceWarning: unclosed file (#681)
Signed-off-by: Mickaël Schoentgen <contact@tiger-222.fr>
2019-01-08 16:59:23 +08:00
Mickaël Schoentgen
3dc50529ca Fix DeprecationWarning: invalid escape sequence (#679)
Signed-off-by: Mickaël Schoentgen <contact@tiger-222.fr>
2019-01-08 16:58:47 +08:00
Mickaël Schoentgen
6128533319 Fix use of deprecated assertEquals() in tests (#680) 2019-01-06 09:12:17 +08:00
Jitendra_Sharma
f4806eb48c manacher's algorithm to find palindromic string (#676)
manacher's algorithm to find palindromic string in linear time complexity
2019-01-02 19:17:56 +08:00
raksa
ad0bc2bb8b make images' path specific (#671)
fixed wrong image's path while debuggin in VSCode
2018-12-26 21:06:34 +08:00
Robert Bergers
f6d241e52d Clean up (#488)
* Cleaning up the README

Spell-check, citing sources, standardizing the format

* Cited missing source

* cleaning up the readme

* Update README.md

* Update README.md

* standardized spacing

* README is all neat and tidy
2018-12-25 21:50:49 +01:00
Jithendra Yenugula
d26311424d Adding a program for swap nodes in linkedlist (#667)
* Adding a program for swap nodes in linkedlist

* Updating swapNodes
2018-12-25 21:09:36 +08:00
harshildarji
f7d6d501c2 Merge branch 'master' of git://github.com/SafariGit/Python 2018-12-17 16:40:27 +01:00
Mikael Souza
2e2fadf4db Fixed bug where an empty stack would cause error 2018-12-17 10:45:54 -04:00
Mikael Souza
a8cfc14737 Added more parentheses examples 2018-12-17 10:45:16 -04:00
Mikael Souza
2d082cf19c Changed import from .Stack to stack 2018-12-17 10:44:38 -04:00
Safari
069d2b9cb6
All Python Version 3
Added functions to get all nodes for some algorithms and time calculation for dfs and bfs.
2018-12-16 22:19:40 +03:30
harshildarji
eb5ccd5bda Merge branch 'master' of git://github.com/SafariGit/Python into SafariGit-master 2018-12-15 23:54:37 +01:00
A Safari
b3a15175bd
Added more functionality
Added topological sort, cycle detection and a function to report the nodes participating in cycles in graph(for a use case I myself needed ).
2018-12-14 23:14:35 +03:30
A Safari
889f8fba3d
Added getting node degree functionality to both directed and undirected graph
Easy to use directed and undirected graph in python 3
2018-12-14 15:28:45 +03:30
A Safari
e97565d21f
Added (Weighted) Undirected graph
Python version 3
2018-12-14 15:08:37 +03:30
A Safari
691f4c0a25
Python version 3 2018-12-14 10:33:01 +03:30
A Safari
687af17d47
Added some examples.
Added examples and comments for more readable code.
2018-12-14 10:31:45 +03:30
A Safari
fa2eecdc30
Directed graph with optional weight assignment .
Containing graph auto-fill, dfs and bfs.
2018-12-14 10:22:18 +03:30
harshildarji
a0cf8d95cd Merge branch 'patch-11' of git://github.com/SandersLin/Python into SandersLin-patch-11 2018-12-06 21:38:20 +01:00
harshildarji
d555a492dc Merge branch 'patch-12' of git://github.com/SandersLin/Python 2018-12-06 21:34:33 +01:00