3545 Commits

Author SHA1 Message Date
2046a7b72f Merge pull request #116 from RiptideBo/master
master
2017-10-15 09:25:16 +05:30
944c12866c Merge pull request #168 from yeggasd/master
Added Vigenere Cipher description
2017-10-14 23:28:53 +05:30
d7fccf5069 Updated README.md
Added Vigenere Cipher description
2017-10-15 00:44:53 +08:00
123b8a30ad added simple chaos machine impl. to hashes/ 2017-10-14 15:46:59 +02:00
db3b628904 Merge pull request #165 from andrealmeid/master
Add counting sort
2017-10-14 18:07:02 +05:30
ec9fdaa918 Merge pull request #160 from kiandru/fastfibonacci
Added fastfibonacci.py
2017-10-14 09:56:08 +05:30
eb8375d138 Commented travis tag
Commented travis tag untill we find suitable travis.yml
2017-10-14 09:54:52 +05:30
35d3873716 Add counting sort 2017-10-14 03:07:02 +00:00
85c1e03b63 Merge pull request #149 from KyleScharnhorst/master
Fix: typo in multiple files.
2017-10-13 21:32:42 +05:30
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
81ab3249d4 Revert "There were 2 codes for BFS and DFS in data-structure/Graph." (#163) 2017-10-13 20:45:39 +05:30
e0211794da Changed the typographical error (#132)
Changed the typo in line 113 and 115 regarding recursive binary search algorithm, found by a user who commented in comments.
2017-10-13 20:33:40 +05:30
86a5b0345f Recursive solution to insert_tail in singly_LinkedList 2017-10-12 23:56:14 -07:00
00575aace6 Add Floyd-Warshall Algorithm 2017-10-13 11:32:05 +05:30
176c330925 Add Bellman-Ford Algorithm 2017-10-13 11:31:06 +05:30
5d83eb7e56 Add Dijkstra's Algorithm 2017-10-13 11:30:26 +05:30
a07baadf04 Added fastfibonacci.py 2017-10-12 21:35:23 +02:00
09131a70a1 implemented jump search 2017-10-12 14:40:15 +05:30
247089decc Update minimum_partition.py
The loop for finding differences had issues of float being iterated. Has been fixed.
2017-10-12 03:28:43 +05:30
aac224dc1b Update radix_sort.py
This will fix the error in the list index showing as float
2017-10-12 01:28:12 +05:30
7c9a07c0a0 Merge remote-tracking branch 'upstream/master' 2017-10-11 14:00:41 +08:00
875c6cde16 Add Linear Congruential Generator 2017-10-10 21:46:07 -07:00
f9156cfb71 Merge pull request #152 from nbrgr/DecisionTree
Implementation of a regression tree in python
2017-10-10 23:06:14 +05:30
59fc956456 Merge pull request #153 from fickleEfrit/patch-1
Create quick_select.py
2017-10-10 23:05:55 +05:30
48dc64fbff Merge pull request #154 from alveeno/master
Fixed compilation errors, fixes for readability/convention, changed d…
2017-10-10 23:05:40 +05:30
a3b72c5fd3 Merge pull request #155 from TaylorL19/master
Fixed binary search to correctly recurse to left half and right half
2017-10-10 23:05:25 +05:30
8f71b30995 Fixed binary search to correctly recurse to left half and right half 2017-10-10 11:57:16 -05:00
14e6372196 Added counting sort in python 2017-10-10 21:41:01 +05:30
ab058ab0b5 changed rigt->right, a typo fix. 2017-10-09 17:05:14 -07:00
dc5e86b701 Fixed compilation errors, fixes for readability/convention, changed double equals to boolean equality operator 'is' 2017-10-09 17:00:37 -07:00
cb3ff4a8f8 Create quick_select.py 2017-10-09 17:26:27 -04:00
37967bd0cf Fixed case where function didn't return where it should
I added these return statements so that invalid inputs or valid end cases would no longer continue running through the rest of the function.
2017-10-09 12:42:51 -05:00
8fb1eb7bdf Implementation of a regression tree in python
I've implemented a basic decision tree in python as an example of how they work. Although the class I've created only works on one dimensional data sets, the reader should be able to generalize it to higher dimensions should they need to.
2017-10-09 12:36:33 -05:00
7447a9f9c7 Added Ternary Search Algorithm 2017-10-09 03:19:39 +01:00
0393c5ad38 Update binary_exponentiation.py 2017-10-08 13:12:33 +05:30
f5917f589c Binary Exponentiation for Multiplication 2017-10-08 13:10:05 +05:30
f4c6578ece Binary Exponentiation for a^b 2017-10-08 13:00:13 +05:30
a36ca7c42f Create binary_exponentiation.py 2017-10-08 12:59:18 +05:30
677dfe93bb Delete binary_exponentiation.java 2017-10-08 12:58:59 +05:30
b695175da3 binary exponentiation 2017-10-08 12:42:13 +05:30
014786e340 Fix: typo in multiple files. 2017-10-07 06:47:50 -07:00
3ecb193ae6 Merge pull request #148 from b1o0d4x3/master
There were 2 codes for BFS and DFS in data-structure/Graph.
2017-10-07 09:46:38 +05:30
d33044eb05 Delete P02_DepthFirstSearch.py 2017-10-06 15:25:25 +05:30
2a916b010b Delete P01_BreadthFirstSearch.py 2017-10-06 15:24:56 +05:30
e8d0c7e54a Added Code in Dynamic Programming section for Longest Strictly Increasing Subsequence in O(nlogn) time 2017-10-06 12:11:19 +05:30
17e1a92f49 Refactor Stack 2017-10-05 23:31:59 -05:00
46b82fa249 Added Next Greater Element
Element       NGE
   4      -->   5
   5      -->   25
   2      -->   25
   25     -->   -1
2017-10-05 01:40:12 +05:30
271cc48a2b Update A*.py 2017-10-03 21:10:34 +05:30
9ba6426aad Added A* Algorithm 2017-10-03 20:29:29 +05:30
07fb7d695a added k means clustering algorithm, usage doc inside. 2017-10-02 21:13:43 +05:30