mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 05:21:09 +00:00
Code Issues Packages Projects Releases Wiki Activity
2,310 Commits 8 Branches 0 Tags 418 MiB
99983c91ca
Commit Graph

285 Commits

Author SHA1 Message Date
Harshil
00c13c29b9
Merge pull request #243 from cclauss/patch-1 
Fix unresolved name: insert_tail()
 2018-01-22 07:12:36 +05:30
cclauss
a88ad60365
Update singly_LinkedList.py 2018-01-21 08:59:55 +01:00
cclauss
d043448fd9
Fix unresolved name: insert_tail() 
insert_tail(Head.next, data) --> Head.next.insert_tail(data)

Fixes: $ __flake8 . --count --select=E901,E999,F821,F822,F823 --show-source --statistics__
```
./data_structures/LinkedList/singly_LinkedList.py:14:13: F821 undefined name 'insert_tail'
            insert_tail(Head.next, data)
            ^
1     F821 undefined name 'insert_tail'
```

Also formats the code to be compliant with [PEP8](http://pep8.org).
 2018-01-21 08:56:16 +01:00
cclauss
4ee0e620cb Modernize Python 2 code to get ready for Python 3 AGAIN 2018-01-21 08:25:19 +01:00
cclauss
3f6760ee15
noqa: F821 This syntax is Python 3 only 2018-01-20 12:35:12 +01:00
cclauss
b3873be7b5
noqa to silence flake8 on Python 3 only syntax 2018-01-20 12:31:12 +01:00
ashu01
06c7827a94 1. typo fix {Arrays| 2017-12-31 14:33:14 +05:30
ashu01
4fb978cf58 1. typo fix {playfair_cipher.py, AVL.py} 
2. Corrected Logic {AVL.py, 104-107}
3. Removed unnecessary semicolons {BellmanFord.py, Dijkstra.py}
 2017-12-31 14:30:31 +05:30
cclauss
e31c780d94 Modernize Python 2 code to get ready for Python 3 2017-11-25 12:41:55 +01:00
cclauss
4e06949072 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Harshil
a03b2eafc0
Merge pull request #204 from erdenezul/even_tree_problem 
add even tree problem
 2017-11-15 19:10:05 +05:30
Harshil
4306482996
Merge pull request #161 from arpanjain97/master 
Add shortest path algorithms
 2017-11-03 16:05:02 +05:30
Erdenezul
e0733c26f2 add even tree problem 2017-11-03 15:02:10 +08:00
Pablo
9d8824658a Finished delete function and added some prints functions too 2017-10-28 18:33:14 -03:00
Pablo
f766bb4216 Added delete function 2017-10-28 16:18:21 -03:00
Pablo
54700f2c8f Added delete function 2017-10-28 16:17:55 -03:00
Harshil
07e8e25672 Merge pull request #190 from jyotsana19/master 
Added Dequeue in Python
 2017-10-26 11:31:09 +05:30
Harshil
8f3abf5ce6 Merge pull request #186 from gilbertoalexsantos/union-find 
Created Union-Find algorithm
 2017-10-26 11:30:58 +05:30
Harshil
55ebf703f8 Merge pull request #184 from pablo9891/master 
Rename binary_search_tree and added a getNode function
 2017-10-26 11:30:31 +05:30
Harshil
6bdf4fc2d1 Merge pull request #182 from tonydelanuez/patch-1 
Adding reverse() to singly-linked list
 2017-10-25 14:12:58 +05:30
97arushisharma
9bc80eac2d Added Dequeue in Python 2017-10-25 01:37:11 +05:30
Harshil
f07c8d517e Merge pull request #178 from SaBuZa/Lazy-Segment-Tree 
Lazy Segment Tree
 2017-10-24 11:27:40 +05:30
Harshil
f6696d0e65 Merge pull request #177 from SaBuZa/Segment-Tree 
Add Segment tree
 2017-10-24 11:27:32 +05:30
Harshil
3b69bfcb33 Merge pull request #176 from imcgeek/patch-1 
Create Arrays
 2017-10-24 11:27:17 +05:30
Gilberto Alexandre dos Santos
7180f08204 Created Union-Find algorithm 2017-10-23 22:41:46 -03:00
Pablo
3786c0d0ea Deleted binary_seach_tree 2017-10-22 20:30:53 -03:00
Pablo
0ad029cb11 Added getNode function and made changes to insert function 2017-10-22 20:13:06 -03:00
Tony De La Nuez
226a0a4ad8 Adding reverse() to singly-linked list 
Updating singly-linked list to include a reverse method using the three-way shuffle method.
 2017-10-22 18:04:10 -05:00
Sarot Busala
2617de848e Add Lazy Segment Tree 
Add Lazy Segment Tree with Lazy Approach
 2017-10-20 18:47:06 +07:00
Sarot Busala
e7e8558b63 Add Segment Tree 
Add simple Segment Tree (No optimization)
 2017-10-20 18:24:11 +07:00
Vishal Kumar
29f8e5edd8 Create Arrays 
"Arrays implementation" using python programming.
 2017-10-20 16:10:33 +05:30
Sarot Busala
d68d0ef05c Add Fenwick Tree 
Add Fenwick Tree (Binary Index Tree)
 2017-10-20 16:45:17 +07:00
Harshil
606e69682f Merge pull request #146 from chrismclennon/stack 
Refactor data_structures.Stacks
 2017-10-19 09:37:57 +05:30
Harshil
7fe8fdc792 Merge pull request #138 from rafaelleru/master 
working on #93
 2017-10-19 09:35:45 +05:30
Harshil
2b8b65a445 Merge pull request #143 from rajnishyadav321/patch-1 
Added Next Greater Element
 2017-10-18 11:11:10 +05:30
Harshil
438a9c60bc Merge pull request #162 from coreywho/master 
Recursive solution to insert_tail in singly_LinkedList
 2017-10-17 18:53:39 +05:30
Harshil
aab6d58c0b Merge pull request #134 from malikshubham827/master 
Added Dijkstra Algorithm
 2017-10-16 09:47:46 +05:30
Sachin Arora
974acef310 Deleting duplicate BFS and DFS files. (#164) 
* Deleting duplicate file BFS.

* deleting duplicate file DFS.

* Rename P01_BreadthFirstSearch.py to BreadthFirstSearch.py

* Rename P02_DepthFirstSearch.py to DepthFirstSearch.py
 2017-10-13 21:03:16 +05:30
Sachin Arora
81ab3249d4 Revert "There were 2 codes for BFS and DFS in data-structure/Graph." (#163) 2017-10-13 20:45:39 +05:30
Corey Hu
86a5b0345f Recursive solution to insert_tail in singly_LinkedList 2017-10-12 23:56:14 -07:00
arpanjain97
00575aace6 Add Floyd-Warshall Algorithm 2017-10-13 11:32:05 +05:30
arpanjain97
176c330925 Add Bellman-Ford Algorithm 2017-10-13 11:31:06 +05:30
arpanjain97
5d83eb7e56 Add Dijkstra's Algorithm 2017-10-13 11:30:26 +05:30
Alvin Nguyen
ab058ab0b5 changed rigt->right, a typo fix. 2017-10-09 17:05:14 -07:00
Alvin Nguyen
dc5e86b701 Fixed compilation errors, fixes for readability/convention, changed double equals to boolean equality operator 'is' 2017-10-09 17:00:37 -07:00
b1o0d4x3
d33044eb05 Delete P02_DepthFirstSearch.py 2017-10-06 15:25:25 +05:30
b1o0d4x3
2a916b010b Delete P01_BreadthFirstSearch.py 2017-10-06 15:24:56 +05:30
Chris McLennon
17e1a92f49 Refactor Stack 2017-10-05 23:31:59 -05:00
rajnishyadav321
46b82fa249 Added Next Greater Element 
Element       NGE
   4      -->   5
   5      -->   25
   2      -->   25
   25     -->   -1
 2017-10-05 01:40:12 +05:30
Rafael Leyva Ruiz
6903d95b41 AVL done 2017-10-02 16:32:59 +02:00
malikshubham827
4d4b0ff31a Added Dijkstra Algorithm 2017-10-01 00:06:03 +05:30
Daniel K
42c5863f4e Merged Graphs 2017-09-28 10:40:22 -04:00
Javon Davis
1bed547226 Trie implementation (#111) 
* Started Trie implementation.

* Basic definition of Trie in comments at the top of the file
* Defined Trie class and method signatures.

* * Renamed method signatures to match formal definitions

* Finished Simple Trie implementation and added test functions
* Finished function to insert a word into Trie
* Finished function to find a word in the Trie
* Added Test functions with Assertions

* Updated test function to read from the Dictionary.txt file in repository

* * No longer using $ to mark end of word
* No longer reading from file but instead provided simple sample input for easier testing

* Deleting empty __init__.py file
 2017-09-10 23:40:33 +05:30
Avkaran singh
75007332e4 Create singly_LinkedList.py (#110) 
* Create singly_LinkedList.py

* Update singly_LinkedList.py

* Update singly_LinkedList.py

* Update singly_LinkedList.py

* Update singly_LinkedList.py

* Update singly_LinkedList.py
 2017-09-10 00:33:31 +05:30
RGauthamRam
7e26755140 Added front to indicate the starting of the Queue 
Front variable is added so that dequeue can be done any number of times.Without front,it displays only self.entries[0] as dequeued.
 2017-09-03 22:33:24 +05:30
Omkar Pathak
0f2edefc2f Python Graph implementation 2017-07-20 06:51:04 +05:30
Omkar Pathak
2af624ff01 Checking balanced parantheses using Stack 2017-07-16 11:26:11 +05:30
Omkar Pathak
ce3e91a420 Infix to Postfix conversion using Stack 2017-07-16 11:25:50 +05:30
Omkar Pathak
6c3b274246 Python implementation of Stack 2017-07-16 11:25:32 +05:30
Rafael
8e41aca1b9 node now eses pythonproperties 2017-07-10 18:29:45 +02:00
Rafael
d8cd33add2 using python properties 2017-07-08 20:50:47 +02:00
Rafael
67f23f59b1 rotate left almost working 2017-07-08 01:26:49 +02:00
Rafael
8384cbb879 finish AVL 2017-07-07 20:06:33 +02:00
Rafael
d8a0afc550 fix error in preshow 2017-07-07 19:08:04 +02:00
Rafael
f65fe8c858 more rotations 2017-07-06 21:13:56 +02:00
Rafael
0b7d3a5c97 Rotate left and right done 2017-07-05 20:37:47 +02:00
Rafael
3ead193f0e Done Node and Insert method 2017-07-04 18:48:27 +02:00
Rafael
817c27462b fix some style errors 2017-07-04 18:46:46 +02:00
Rafael
a3972dd9b4 fix indent error 2017-06-30 21:12:10 +02:00
Francisco Matias
1ce58efe1f With example 2017-06-21 00:44:26 -03:00
Francisco Matias
da414d89d9 fixed error 2017-06-20 04:43:00 -03:00
Francisco Matias
8c9d9498b5 print 2017-06-20 04:17:20 -03:00
Francisco Matias
4a9405e1b0 Add Binary Search Tree in data_structures 2017-06-20 02:31:03 -03:00
Ankit Agarwal
fa1e65ee0f Fixing print statement 2017-04-01 21:28:12 +05:30
Ankit Agarwal
e15c0aacc9 Contributing code for Heap data structure, and 
all basic operations associated with it.
 2017-04-01 21:16:11 +05:30
Rian Gallagher
46900cb1e5 Added Doubly Linked List 2016-11-29 13:44:09 +00:00
Henocks
f942742455 Update __init__.py 2016-10-31 15:40:33 +09:00
Harshil
9b054f55d5 Merge pull request #40 from theycallmemac/patch-1 
Create __init__.py
 2016-10-14 22:25:35 +05:30
James Mc Dermott
4a8fa8bfeb Create __init__.py 
Initialising a LinkedList class, using a Node class to store the item and the next pointer.
 2016-10-14 17:23:07 +01:00
James Mc Dermott
4eddeb9396 Create __init__.py 
Initialising of a Stack Class, has three methods: is_empty, push and pop.
 2016-10-14 16:15:26 +01:00
1d66680952 Formatting Fix 2016-10-09 12:21:41 -04:00
d79105d5cf Added queue on stack 2016-10-09 12:20:45 -04:00
13dd4a1e5d Added toString and rotate 2016-10-09 11:51:43 -04:00
82ffc6e50b Method Names Changed for completeness 2016-10-08 21:39:21 -04:00
9b2d32e8a3 Added Queue 2016-10-08 21:12:14 -04:00