From 87680614d73433f79ef19fce0ff0de2d7c949339 Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Sun, 30 Sep 2018 23:30:23 +0300 Subject: [PATCH 1/7] top level fix --- .../Bisection.py | 0 .../Intersection.py | 0 .../LUdecomposition.py | 0 .../NewtonMethod.py | 0 .../NewtonRaphsonMethod.py | 0 .../Problem 01/sol1.py | 0 .../Problem 01/sol2.py | 0 .../Problem 01/sol3.py | 0 .../Problem 01/sol4.py | 60 +++++++++---------- .../Problem 02/sol1.py | 0 .../Problem 02/sol2.py | 24 ++++---- .../Problem 02/sol3.py | 0 .../Problem 03/sol1.py | 0 .../Problem 03/sol2.py | 0 .../Problem 04/sol1.py | 0 .../Problem 04/sol2.py | 0 .../Problem 05/sol1.py | 0 .../Problem 05/sol2.py | 0 .../Problem 06/sol1.py | 0 .../Problem 06/sol2.py | 0 .../Problem 07/sol1.py | 0 .../Problem 07/sol2.py | 0 .../Problem 08/sol1.py | 0 .../Problem 10/sol1.py | 0 .../Problem 11/grid.txt | 0 .../Problem 11/sol1.py | 0 .../Problem 11/sol2.py | 0 .../Problem 12/sol1.py | 0 .../Problem 13/sol1.py | 0 .../Problem 14/sol1.py | 0 .../Problem 15/sol1.py | 0 .../Problem 16/sol1.py | 0 .../Problem 17/sol1.py | 0 .../Problem 19/sol1.py | 0 .../Problem 20/sol1.py | 0 .../Problem 20/sol2.py | 0 .../Problem 21/sol1.py | 0 .../Problem 22/p022_names.txt | 0 .../Problem 22/sol1.py | 0 .../Problem 22/sol2.py | 0 .../Problem 24/sol1.py | 0 .../Problem 25/sol1.py | 0 .../Problem 28/sol1.py | 0 .../Problem 29/solution.py | 0 .../Problem 36/sol1.py | 0 .../Problem 40/sol1.py | 0 .../Problem 48/sol1.py | 0 .../Problem 52/sol1.py | 0 .../Problem 53/sol1.py | 0 .../Problem 76/sol1.py | 0 .../Problem 9/sol1.py | 0 .../Problem 9/sol2.py | 0 {Project Euler => project_euler}/README.md | 0 53 files changed, 42 insertions(+), 42 deletions(-) rename {ArithmeticAnalysis => arithmetic_analysis}/Bisection.py (100%) rename {ArithmeticAnalysis => arithmetic_analysis}/Intersection.py (100%) rename {ArithmeticAnalysis => arithmetic_analysis}/LUdecomposition.py (100%) rename {ArithmeticAnalysis => arithmetic_analysis}/NewtonMethod.py (100%) rename {ArithmeticAnalysis => arithmetic_analysis}/NewtonRaphsonMethod.py (100%) rename {Project Euler => project_euler}/Problem 01/sol1.py (100%) rename {Project Euler => project_euler}/Problem 01/sol2.py (100%) rename {Project Euler => project_euler}/Problem 01/sol3.py (100%) rename {Project Euler => project_euler}/Problem 01/sol4.py (94%) rename {Project Euler => project_euler}/Problem 02/sol1.py (100%) rename {Project Euler => project_euler}/Problem 02/sol2.py (95%) rename {Project Euler => project_euler}/Problem 02/sol3.py (100%) rename {Project Euler => project_euler}/Problem 03/sol1.py (100%) rename {Project Euler => project_euler}/Problem 03/sol2.py (100%) rename {Project Euler => project_euler}/Problem 04/sol1.py (100%) rename {Project Euler => project_euler}/Problem 04/sol2.py (100%) rename {Project Euler => project_euler}/Problem 05/sol1.py (100%) rename {Project Euler => project_euler}/Problem 05/sol2.py (100%) rename {Project Euler => project_euler}/Problem 06/sol1.py (100%) rename {Project Euler => project_euler}/Problem 06/sol2.py (100%) rename {Project Euler => project_euler}/Problem 07/sol1.py (100%) rename {Project Euler => project_euler}/Problem 07/sol2.py (100%) rename {Project Euler => project_euler}/Problem 08/sol1.py (100%) rename {Project Euler => project_euler}/Problem 10/sol1.py (100%) rename {Project Euler => project_euler}/Problem 11/grid.txt (100%) rename {Project Euler => project_euler}/Problem 11/sol1.py (100%) rename {Project Euler => project_euler}/Problem 11/sol2.py (100%) rename {Project Euler => project_euler}/Problem 12/sol1.py (100%) rename {Project Euler => project_euler}/Problem 13/sol1.py (100%) rename {Project Euler => project_euler}/Problem 14/sol1.py (100%) rename {Project Euler => project_euler}/Problem 15/sol1.py (100%) rename {Project Euler => project_euler}/Problem 16/sol1.py (100%) rename {Project Euler => project_euler}/Problem 17/sol1.py (100%) rename {Project Euler => project_euler}/Problem 19/sol1.py (100%) rename {Project Euler => project_euler}/Problem 20/sol1.py (100%) rename {Project Euler => project_euler}/Problem 20/sol2.py (100%) rename {Project Euler => project_euler}/Problem 21/sol1.py (100%) rename {Project Euler => project_euler}/Problem 22/p022_names.txt (100%) rename {Project Euler => project_euler}/Problem 22/sol1.py (100%) rename {Project Euler => project_euler}/Problem 22/sol2.py (100%) rename {Project Euler => project_euler}/Problem 24/sol1.py (100%) rename {Project Euler => project_euler}/Problem 25/sol1.py (100%) rename {Project Euler => project_euler}/Problem 28/sol1.py (100%) rename {Project Euler => project_euler}/Problem 29/solution.py (100%) rename {Project Euler => project_euler}/Problem 36/sol1.py (100%) rename {Project Euler => project_euler}/Problem 40/sol1.py (100%) rename {Project Euler => project_euler}/Problem 48/sol1.py (100%) rename {Project Euler => project_euler}/Problem 52/sol1.py (100%) rename {Project Euler => project_euler}/Problem 53/sol1.py (100%) rename {Project Euler => project_euler}/Problem 76/sol1.py (100%) rename {Project Euler => project_euler}/Problem 9/sol1.py (100%) rename {Project Euler => project_euler}/Problem 9/sol2.py (100%) rename {Project Euler => project_euler}/README.md (100%) diff --git a/ArithmeticAnalysis/Bisection.py b/arithmetic_analysis/Bisection.py similarity index 100% rename from ArithmeticAnalysis/Bisection.py rename to arithmetic_analysis/Bisection.py diff --git a/ArithmeticAnalysis/Intersection.py b/arithmetic_analysis/Intersection.py similarity index 100% rename from ArithmeticAnalysis/Intersection.py rename to arithmetic_analysis/Intersection.py diff --git a/ArithmeticAnalysis/LUdecomposition.py b/arithmetic_analysis/LUdecomposition.py similarity index 100% rename from ArithmeticAnalysis/LUdecomposition.py rename to arithmetic_analysis/LUdecomposition.py diff --git a/ArithmeticAnalysis/NewtonMethod.py b/arithmetic_analysis/NewtonMethod.py similarity index 100% rename from ArithmeticAnalysis/NewtonMethod.py rename to arithmetic_analysis/NewtonMethod.py diff --git a/ArithmeticAnalysis/NewtonRaphsonMethod.py b/arithmetic_analysis/NewtonRaphsonMethod.py similarity index 100% rename from ArithmeticAnalysis/NewtonRaphsonMethod.py rename to arithmetic_analysis/NewtonRaphsonMethod.py diff --git a/Project Euler/Problem 01/sol1.py b/project_euler/Problem 01/sol1.py similarity index 100% rename from Project Euler/Problem 01/sol1.py rename to project_euler/Problem 01/sol1.py diff --git a/Project Euler/Problem 01/sol2.py b/project_euler/Problem 01/sol2.py similarity index 100% rename from Project Euler/Problem 01/sol2.py rename to project_euler/Problem 01/sol2.py diff --git a/Project Euler/Problem 01/sol3.py b/project_euler/Problem 01/sol3.py similarity index 100% rename from Project Euler/Problem 01/sol3.py rename to project_euler/Problem 01/sol3.py diff --git a/Project Euler/Problem 01/sol4.py b/project_euler/Problem 01/sol4.py similarity index 94% rename from Project Euler/Problem 01/sol4.py rename to project_euler/Problem 01/sol4.py index 7941f5fcd3fe..36a91e7043aa 100644 --- a/Project Euler/Problem 01/sol4.py +++ b/project_euler/Problem 01/sol4.py @@ -1,30 +1,30 @@ -def mulitples(limit): - xmulti = [] - zmulti = [] - z = 3 - x = 5 - temp = 1 - while True: - result = z * temp - if (result < limit): - zmulti.append(result) - temp += 1 - else: - temp = 1 - break - while True: - result = x * temp - if (result < limit): - xmulti.append(result) - temp += 1 - else: - break - collection = list(set(xmulti+zmulti)) - return (sum(collection)) - - - - - - -print (mulitples(1000)) +def mulitples(limit): + xmulti = [] + zmulti = [] + z = 3 + x = 5 + temp = 1 + while True: + result = z * temp + if (result < limit): + zmulti.append(result) + temp += 1 + else: + temp = 1 + break + while True: + result = x * temp + if (result < limit): + xmulti.append(result) + temp += 1 + else: + break + collection = list(set(xmulti+zmulti)) + return (sum(collection)) + + + + + + +print (mulitples(1000)) diff --git a/Project Euler/Problem 02/sol1.py b/project_euler/Problem 02/sol1.py similarity index 100% rename from Project Euler/Problem 02/sol1.py rename to project_euler/Problem 02/sol1.py diff --git a/Project Euler/Problem 02/sol2.py b/project_euler/Problem 02/sol2.py similarity index 95% rename from Project Euler/Problem 02/sol2.py rename to project_euler/Problem 02/sol2.py index 9bbd0c535d63..a56b6c7a8782 100644 --- a/Project Euler/Problem 02/sol2.py +++ b/project_euler/Problem 02/sol2.py @@ -1,12 +1,12 @@ -def fib(n): - a, b, s = 0, 1, 0 - while b < n: - if b % 2 == 0 and b < n: s += b - a, b = b, a+b - ls.append(s) - -T = int(input().strip()) -ls = [] -for _ in range(T): - fib(int(input().strip())) -print(*ls, sep = '\n') +def fib(n): + a, b, s = 0, 1, 0 + while b < n: + if b % 2 == 0 and b < n: s += b + a, b = b, a+b + ls.append(s) + +T = int(input().strip()) +ls = [] +for _ in range(T): + fib(int(input().strip())) +print(*ls, sep = '\n') diff --git a/Project Euler/Problem 02/sol3.py b/project_euler/Problem 02/sol3.py similarity index 100% rename from Project Euler/Problem 02/sol3.py rename to project_euler/Problem 02/sol3.py diff --git a/Project Euler/Problem 03/sol1.py b/project_euler/Problem 03/sol1.py similarity index 100% rename from Project Euler/Problem 03/sol1.py rename to project_euler/Problem 03/sol1.py diff --git a/Project Euler/Problem 03/sol2.py b/project_euler/Problem 03/sol2.py similarity index 100% rename from Project Euler/Problem 03/sol2.py rename to project_euler/Problem 03/sol2.py diff --git a/Project Euler/Problem 04/sol1.py b/project_euler/Problem 04/sol1.py similarity index 100% rename from Project Euler/Problem 04/sol1.py rename to project_euler/Problem 04/sol1.py diff --git a/Project Euler/Problem 04/sol2.py b/project_euler/Problem 04/sol2.py similarity index 100% rename from Project Euler/Problem 04/sol2.py rename to project_euler/Problem 04/sol2.py diff --git a/Project Euler/Problem 05/sol1.py b/project_euler/Problem 05/sol1.py similarity index 100% rename from Project Euler/Problem 05/sol1.py rename to project_euler/Problem 05/sol1.py diff --git a/Project Euler/Problem 05/sol2.py b/project_euler/Problem 05/sol2.py similarity index 100% rename from Project Euler/Problem 05/sol2.py rename to project_euler/Problem 05/sol2.py diff --git a/Project Euler/Problem 06/sol1.py b/project_euler/Problem 06/sol1.py similarity index 100% rename from Project Euler/Problem 06/sol1.py rename to project_euler/Problem 06/sol1.py diff --git a/Project Euler/Problem 06/sol2.py b/project_euler/Problem 06/sol2.py similarity index 100% rename from Project Euler/Problem 06/sol2.py rename to project_euler/Problem 06/sol2.py diff --git a/Project Euler/Problem 07/sol1.py b/project_euler/Problem 07/sol1.py similarity index 100% rename from Project Euler/Problem 07/sol1.py rename to project_euler/Problem 07/sol1.py diff --git a/Project Euler/Problem 07/sol2.py b/project_euler/Problem 07/sol2.py similarity index 100% rename from Project Euler/Problem 07/sol2.py rename to project_euler/Problem 07/sol2.py diff --git a/Project Euler/Problem 08/sol1.py b/project_euler/Problem 08/sol1.py similarity index 100% rename from Project Euler/Problem 08/sol1.py rename to project_euler/Problem 08/sol1.py diff --git a/Project Euler/Problem 10/sol1.py b/project_euler/Problem 10/sol1.py similarity index 100% rename from Project Euler/Problem 10/sol1.py rename to project_euler/Problem 10/sol1.py diff --git a/Project Euler/Problem 11/grid.txt b/project_euler/Problem 11/grid.txt similarity index 100% rename from Project Euler/Problem 11/grid.txt rename to project_euler/Problem 11/grid.txt diff --git a/Project Euler/Problem 11/sol1.py b/project_euler/Problem 11/sol1.py similarity index 100% rename from Project Euler/Problem 11/sol1.py rename to project_euler/Problem 11/sol1.py diff --git a/Project Euler/Problem 11/sol2.py b/project_euler/Problem 11/sol2.py similarity index 100% rename from Project Euler/Problem 11/sol2.py rename to project_euler/Problem 11/sol2.py diff --git a/Project Euler/Problem 12/sol1.py b/project_euler/Problem 12/sol1.py similarity index 100% rename from Project Euler/Problem 12/sol1.py rename to project_euler/Problem 12/sol1.py diff --git a/Project Euler/Problem 13/sol1.py b/project_euler/Problem 13/sol1.py similarity index 100% rename from Project Euler/Problem 13/sol1.py rename to project_euler/Problem 13/sol1.py diff --git a/Project Euler/Problem 14/sol1.py b/project_euler/Problem 14/sol1.py similarity index 100% rename from Project Euler/Problem 14/sol1.py rename to project_euler/Problem 14/sol1.py diff --git a/Project Euler/Problem 15/sol1.py b/project_euler/Problem 15/sol1.py similarity index 100% rename from Project Euler/Problem 15/sol1.py rename to project_euler/Problem 15/sol1.py diff --git a/Project Euler/Problem 16/sol1.py b/project_euler/Problem 16/sol1.py similarity index 100% rename from Project Euler/Problem 16/sol1.py rename to project_euler/Problem 16/sol1.py diff --git a/Project Euler/Problem 17/sol1.py b/project_euler/Problem 17/sol1.py similarity index 100% rename from Project Euler/Problem 17/sol1.py rename to project_euler/Problem 17/sol1.py diff --git a/Project Euler/Problem 19/sol1.py b/project_euler/Problem 19/sol1.py similarity index 100% rename from Project Euler/Problem 19/sol1.py rename to project_euler/Problem 19/sol1.py diff --git a/Project Euler/Problem 20/sol1.py b/project_euler/Problem 20/sol1.py similarity index 100% rename from Project Euler/Problem 20/sol1.py rename to project_euler/Problem 20/sol1.py diff --git a/Project Euler/Problem 20/sol2.py b/project_euler/Problem 20/sol2.py similarity index 100% rename from Project Euler/Problem 20/sol2.py rename to project_euler/Problem 20/sol2.py diff --git a/Project Euler/Problem 21/sol1.py b/project_euler/Problem 21/sol1.py similarity index 100% rename from Project Euler/Problem 21/sol1.py rename to project_euler/Problem 21/sol1.py diff --git a/Project Euler/Problem 22/p022_names.txt b/project_euler/Problem 22/p022_names.txt similarity index 100% rename from Project Euler/Problem 22/p022_names.txt rename to project_euler/Problem 22/p022_names.txt diff --git a/Project Euler/Problem 22/sol1.py b/project_euler/Problem 22/sol1.py similarity index 100% rename from Project Euler/Problem 22/sol1.py rename to project_euler/Problem 22/sol1.py diff --git a/Project Euler/Problem 22/sol2.py b/project_euler/Problem 22/sol2.py similarity index 100% rename from Project Euler/Problem 22/sol2.py rename to project_euler/Problem 22/sol2.py diff --git a/Project Euler/Problem 24/sol1.py b/project_euler/Problem 24/sol1.py similarity index 100% rename from Project Euler/Problem 24/sol1.py rename to project_euler/Problem 24/sol1.py diff --git a/Project Euler/Problem 25/sol1.py b/project_euler/Problem 25/sol1.py similarity index 100% rename from Project Euler/Problem 25/sol1.py rename to project_euler/Problem 25/sol1.py diff --git a/Project Euler/Problem 28/sol1.py b/project_euler/Problem 28/sol1.py similarity index 100% rename from Project Euler/Problem 28/sol1.py rename to project_euler/Problem 28/sol1.py diff --git a/Project Euler/Problem 29/solution.py b/project_euler/Problem 29/solution.py similarity index 100% rename from Project Euler/Problem 29/solution.py rename to project_euler/Problem 29/solution.py diff --git a/Project Euler/Problem 36/sol1.py b/project_euler/Problem 36/sol1.py similarity index 100% rename from Project Euler/Problem 36/sol1.py rename to project_euler/Problem 36/sol1.py diff --git a/Project Euler/Problem 40/sol1.py b/project_euler/Problem 40/sol1.py similarity index 100% rename from Project Euler/Problem 40/sol1.py rename to project_euler/Problem 40/sol1.py diff --git a/Project Euler/Problem 48/sol1.py b/project_euler/Problem 48/sol1.py similarity index 100% rename from Project Euler/Problem 48/sol1.py rename to project_euler/Problem 48/sol1.py diff --git a/Project Euler/Problem 52/sol1.py b/project_euler/Problem 52/sol1.py similarity index 100% rename from Project Euler/Problem 52/sol1.py rename to project_euler/Problem 52/sol1.py diff --git a/Project Euler/Problem 53/sol1.py b/project_euler/Problem 53/sol1.py similarity index 100% rename from Project Euler/Problem 53/sol1.py rename to project_euler/Problem 53/sol1.py diff --git a/Project Euler/Problem 76/sol1.py b/project_euler/Problem 76/sol1.py similarity index 100% rename from Project Euler/Problem 76/sol1.py rename to project_euler/Problem 76/sol1.py diff --git a/Project Euler/Problem 9/sol1.py b/project_euler/Problem 9/sol1.py similarity index 100% rename from Project Euler/Problem 9/sol1.py rename to project_euler/Problem 9/sol1.py diff --git a/Project Euler/Problem 9/sol2.py b/project_euler/Problem 9/sol2.py similarity index 100% rename from Project Euler/Problem 9/sol2.py rename to project_euler/Problem 9/sol2.py diff --git a/Project Euler/README.md b/project_euler/README.md similarity index 100% rename from Project Euler/README.md rename to project_euler/README.md From 7f4e2e72b39209d2aae18c5332e080e11314548d Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Sun, 30 Sep 2018 23:54:50 +0300 Subject: [PATCH 2/7] second level dirs fix --- .../{Quine_McCluskey => quine_mc_cluskey}/QuineMcCluskey.py | 0 data_structures/{Binary Tree => binary_tree}/FenwickTree.py | 0 data_structures/{Binary Tree => binary_tree}/LazySegmentTree.py | 0 data_structures/{Binary Tree => binary_tree}/SegmentTree.py | 0 .../{Binary Tree => binary_tree}/binary_search_tree.py | 0 data_structures/{LinkedList => linked_list}/DoublyLinkedList.py | 0 data_structures/{LinkedList => linked_list}/__init__.py | 0 data_structures/{LinkedList => linked_list}/singly_LinkedList.py | 0 data_structures/{UnionFind => union_find}/__init__.py | 0 data_structures/{UnionFind => union_find}/tests_union_find.py | 0 data_structures/{UnionFind => union_find}/union_find.py | 0 project_euler/{Problem 01 => problem_01}/sol1.py | 0 project_euler/{Problem 01 => problem_01}/sol2.py | 0 project_euler/{Problem 01 => problem_01}/sol3.py | 0 project_euler/{Problem 01 => problem_01}/sol4.py | 0 project_euler/{Problem 02 => problem_02}/sol1.py | 0 project_euler/{Problem 02 => problem_02}/sol2.py | 0 project_euler/{Problem 02 => problem_02}/sol3.py | 0 project_euler/{Problem 03 => problem_03}/sol1.py | 0 project_euler/{Problem 03 => problem_03}/sol2.py | 0 project_euler/{Problem 04 => problem_04}/sol1.py | 0 project_euler/{Problem 04 => problem_04}/sol2.py | 0 project_euler/{Problem 05 => problem_05}/sol1.py | 0 project_euler/{Problem 05 => problem_05}/sol2.py | 0 project_euler/{Problem 06 => problem_06}/sol1.py | 0 project_euler/{Problem 06 => problem_06}/sol2.py | 0 project_euler/{Problem 07 => problem_07}/sol1.py | 0 project_euler/{Problem 07 => problem_07}/sol2.py | 0 project_euler/{Problem 08 => problem_08}/sol1.py | 0 project_euler/{Problem 10 => problem_10}/sol1.py | 0 project_euler/{Problem 11 => problem_11}/grid.txt | 0 project_euler/{Problem 11 => problem_11}/sol1.py | 0 project_euler/{Problem 11 => problem_11}/sol2.py | 0 project_euler/{Problem 12 => problem_12}/sol1.py | 0 project_euler/{Problem 13 => problem_13}/sol1.py | 0 project_euler/{Problem 14 => problem_14}/sol1.py | 0 project_euler/{Problem 15 => problem_15}/sol1.py | 0 project_euler/{Problem 16 => problem_16}/sol1.py | 0 project_euler/{Problem 17 => problem_17}/sol1.py | 0 project_euler/{Problem 19 => problem_19}/sol1.py | 0 project_euler/{Problem 20 => problem_20}/sol1.py | 0 project_euler/{Problem 20 => problem_20}/sol2.py | 0 project_euler/{Problem 21 => problem_21}/sol1.py | 0 project_euler/{Problem 22 => problem_22}/p022_names.txt | 0 project_euler/{Problem 22 => problem_22}/sol1.py | 0 project_euler/{Problem 22 => problem_22}/sol2.py | 0 project_euler/{Problem 24 => problem_24}/sol1.py | 0 project_euler/{Problem 25 => problem_25}/sol1.py | 0 project_euler/{Problem 28 => problem_28}/sol1.py | 0 project_euler/{Problem 29 => problem_29}/solution.py | 0 project_euler/{Problem 36 => problem_36}/sol1.py | 0 project_euler/{Problem 40 => problem_40}/sol1.py | 0 project_euler/{Problem 48 => problem_48}/sol1.py | 0 project_euler/{Problem 52 => problem_52}/sol1.py | 0 project_euler/{Problem 53 => problem_53}/sol1.py | 0 project_euler/{Problem 76 => problem_76}/sol1.py | 0 project_euler/{Problem 9 => problem_9}/sol1.py | 0 project_euler/{Problem 9 => problem_9}/sol2.py | 0 58 files changed, 0 insertions(+), 0 deletions(-) rename boolean_algebra/{Quine_McCluskey => quine_mc_cluskey}/QuineMcCluskey.py (100%) rename data_structures/{Binary Tree => binary_tree}/FenwickTree.py (100%) rename data_structures/{Binary Tree => binary_tree}/LazySegmentTree.py (100%) rename data_structures/{Binary Tree => binary_tree}/SegmentTree.py (100%) rename data_structures/{Binary Tree => binary_tree}/binary_search_tree.py (100%) rename data_structures/{LinkedList => linked_list}/DoublyLinkedList.py (100%) rename data_structures/{LinkedList => linked_list}/__init__.py (100%) rename data_structures/{LinkedList => linked_list}/singly_LinkedList.py (100%) rename data_structures/{UnionFind => union_find}/__init__.py (100%) rename data_structures/{UnionFind => union_find}/tests_union_find.py (100%) rename data_structures/{UnionFind => union_find}/union_find.py (100%) rename project_euler/{Problem 01 => problem_01}/sol1.py (100%) rename project_euler/{Problem 01 => problem_01}/sol2.py (100%) rename project_euler/{Problem 01 => problem_01}/sol3.py (100%) rename project_euler/{Problem 01 => problem_01}/sol4.py (100%) rename project_euler/{Problem 02 => problem_02}/sol1.py (100%) rename project_euler/{Problem 02 => problem_02}/sol2.py (100%) rename project_euler/{Problem 02 => problem_02}/sol3.py (100%) rename project_euler/{Problem 03 => problem_03}/sol1.py (100%) rename project_euler/{Problem 03 => problem_03}/sol2.py (100%) rename project_euler/{Problem 04 => problem_04}/sol1.py (100%) rename project_euler/{Problem 04 => problem_04}/sol2.py (100%) rename project_euler/{Problem 05 => problem_05}/sol1.py (100%) rename project_euler/{Problem 05 => problem_05}/sol2.py (100%) rename project_euler/{Problem 06 => problem_06}/sol1.py (100%) rename project_euler/{Problem 06 => problem_06}/sol2.py (100%) rename project_euler/{Problem 07 => problem_07}/sol1.py (100%) rename project_euler/{Problem 07 => problem_07}/sol2.py (100%) rename project_euler/{Problem 08 => problem_08}/sol1.py (100%) rename project_euler/{Problem 10 => problem_10}/sol1.py (100%) rename project_euler/{Problem 11 => problem_11}/grid.txt (100%) rename project_euler/{Problem 11 => problem_11}/sol1.py (100%) rename project_euler/{Problem 11 => problem_11}/sol2.py (100%) rename project_euler/{Problem 12 => problem_12}/sol1.py (100%) rename project_euler/{Problem 13 => problem_13}/sol1.py (100%) rename project_euler/{Problem 14 => problem_14}/sol1.py (100%) rename project_euler/{Problem 15 => problem_15}/sol1.py (100%) rename project_euler/{Problem 16 => problem_16}/sol1.py (100%) rename project_euler/{Problem 17 => problem_17}/sol1.py (100%) rename project_euler/{Problem 19 => problem_19}/sol1.py (100%) rename project_euler/{Problem 20 => problem_20}/sol1.py (100%) rename project_euler/{Problem 20 => problem_20}/sol2.py (100%) rename project_euler/{Problem 21 => problem_21}/sol1.py (100%) rename project_euler/{Problem 22 => problem_22}/p022_names.txt (100%) rename project_euler/{Problem 22 => problem_22}/sol1.py (100%) rename project_euler/{Problem 22 => problem_22}/sol2.py (100%) rename project_euler/{Problem 24 => problem_24}/sol1.py (100%) rename project_euler/{Problem 25 => problem_25}/sol1.py (100%) rename project_euler/{Problem 28 => problem_28}/sol1.py (100%) rename project_euler/{Problem 29 => problem_29}/solution.py (100%) rename project_euler/{Problem 36 => problem_36}/sol1.py (100%) rename project_euler/{Problem 40 => problem_40}/sol1.py (100%) rename project_euler/{Problem 48 => problem_48}/sol1.py (100%) rename project_euler/{Problem 52 => problem_52}/sol1.py (100%) rename project_euler/{Problem 53 => problem_53}/sol1.py (100%) rename project_euler/{Problem 76 => problem_76}/sol1.py (100%) rename project_euler/{Problem 9 => problem_9}/sol1.py (100%) rename project_euler/{Problem 9 => problem_9}/sol2.py (100%) diff --git a/boolean_algebra/Quine_McCluskey/QuineMcCluskey.py b/boolean_algebra/quine_mc_cluskey/QuineMcCluskey.py similarity index 100% rename from boolean_algebra/Quine_McCluskey/QuineMcCluskey.py rename to boolean_algebra/quine_mc_cluskey/QuineMcCluskey.py diff --git a/data_structures/Binary Tree/FenwickTree.py b/data_structures/binary_tree/FenwickTree.py similarity index 100% rename from data_structures/Binary Tree/FenwickTree.py rename to data_structures/binary_tree/FenwickTree.py diff --git a/data_structures/Binary Tree/LazySegmentTree.py b/data_structures/binary_tree/LazySegmentTree.py similarity index 100% rename from data_structures/Binary Tree/LazySegmentTree.py rename to data_structures/binary_tree/LazySegmentTree.py diff --git a/data_structures/Binary Tree/SegmentTree.py b/data_structures/binary_tree/SegmentTree.py similarity index 100% rename from data_structures/Binary Tree/SegmentTree.py rename to data_structures/binary_tree/SegmentTree.py diff --git a/data_structures/Binary Tree/binary_search_tree.py b/data_structures/binary_tree/binary_search_tree.py similarity index 100% rename from data_structures/Binary Tree/binary_search_tree.py rename to data_structures/binary_tree/binary_search_tree.py diff --git a/data_structures/LinkedList/DoublyLinkedList.py b/data_structures/linked_list/DoublyLinkedList.py similarity index 100% rename from data_structures/LinkedList/DoublyLinkedList.py rename to data_structures/linked_list/DoublyLinkedList.py diff --git a/data_structures/LinkedList/__init__.py b/data_structures/linked_list/__init__.py similarity index 100% rename from data_structures/LinkedList/__init__.py rename to data_structures/linked_list/__init__.py diff --git a/data_structures/LinkedList/singly_LinkedList.py b/data_structures/linked_list/singly_LinkedList.py similarity index 100% rename from data_structures/LinkedList/singly_LinkedList.py rename to data_structures/linked_list/singly_LinkedList.py diff --git a/data_structures/UnionFind/__init__.py b/data_structures/union_find/__init__.py similarity index 100% rename from data_structures/UnionFind/__init__.py rename to data_structures/union_find/__init__.py diff --git a/data_structures/UnionFind/tests_union_find.py b/data_structures/union_find/tests_union_find.py similarity index 100% rename from data_structures/UnionFind/tests_union_find.py rename to data_structures/union_find/tests_union_find.py diff --git a/data_structures/UnionFind/union_find.py b/data_structures/union_find/union_find.py similarity index 100% rename from data_structures/UnionFind/union_find.py rename to data_structures/union_find/union_find.py diff --git a/project_euler/Problem 01/sol1.py b/project_euler/problem_01/sol1.py similarity index 100% rename from project_euler/Problem 01/sol1.py rename to project_euler/problem_01/sol1.py diff --git a/project_euler/Problem 01/sol2.py b/project_euler/problem_01/sol2.py similarity index 100% rename from project_euler/Problem 01/sol2.py rename to project_euler/problem_01/sol2.py diff --git a/project_euler/Problem 01/sol3.py b/project_euler/problem_01/sol3.py similarity index 100% rename from project_euler/Problem 01/sol3.py rename to project_euler/problem_01/sol3.py diff --git a/project_euler/Problem 01/sol4.py b/project_euler/problem_01/sol4.py similarity index 100% rename from project_euler/Problem 01/sol4.py rename to project_euler/problem_01/sol4.py diff --git a/project_euler/Problem 02/sol1.py b/project_euler/problem_02/sol1.py similarity index 100% rename from project_euler/Problem 02/sol1.py rename to project_euler/problem_02/sol1.py diff --git a/project_euler/Problem 02/sol2.py b/project_euler/problem_02/sol2.py similarity index 100% rename from project_euler/Problem 02/sol2.py rename to project_euler/problem_02/sol2.py diff --git a/project_euler/Problem 02/sol3.py b/project_euler/problem_02/sol3.py similarity index 100% rename from project_euler/Problem 02/sol3.py rename to project_euler/problem_02/sol3.py diff --git a/project_euler/Problem 03/sol1.py b/project_euler/problem_03/sol1.py similarity index 100% rename from project_euler/Problem 03/sol1.py rename to project_euler/problem_03/sol1.py diff --git a/project_euler/Problem 03/sol2.py b/project_euler/problem_03/sol2.py similarity index 100% rename from project_euler/Problem 03/sol2.py rename to project_euler/problem_03/sol2.py diff --git a/project_euler/Problem 04/sol1.py b/project_euler/problem_04/sol1.py similarity index 100% rename from project_euler/Problem 04/sol1.py rename to project_euler/problem_04/sol1.py diff --git a/project_euler/Problem 04/sol2.py b/project_euler/problem_04/sol2.py similarity index 100% rename from project_euler/Problem 04/sol2.py rename to project_euler/problem_04/sol2.py diff --git a/project_euler/Problem 05/sol1.py b/project_euler/problem_05/sol1.py similarity index 100% rename from project_euler/Problem 05/sol1.py rename to project_euler/problem_05/sol1.py diff --git a/project_euler/Problem 05/sol2.py b/project_euler/problem_05/sol2.py similarity index 100% rename from project_euler/Problem 05/sol2.py rename to project_euler/problem_05/sol2.py diff --git a/project_euler/Problem 06/sol1.py b/project_euler/problem_06/sol1.py similarity index 100% rename from project_euler/Problem 06/sol1.py rename to project_euler/problem_06/sol1.py diff --git a/project_euler/Problem 06/sol2.py b/project_euler/problem_06/sol2.py similarity index 100% rename from project_euler/Problem 06/sol2.py rename to project_euler/problem_06/sol2.py diff --git a/project_euler/Problem 07/sol1.py b/project_euler/problem_07/sol1.py similarity index 100% rename from project_euler/Problem 07/sol1.py rename to project_euler/problem_07/sol1.py diff --git a/project_euler/Problem 07/sol2.py b/project_euler/problem_07/sol2.py similarity index 100% rename from project_euler/Problem 07/sol2.py rename to project_euler/problem_07/sol2.py diff --git a/project_euler/Problem 08/sol1.py b/project_euler/problem_08/sol1.py similarity index 100% rename from project_euler/Problem 08/sol1.py rename to project_euler/problem_08/sol1.py diff --git a/project_euler/Problem 10/sol1.py b/project_euler/problem_10/sol1.py similarity index 100% rename from project_euler/Problem 10/sol1.py rename to project_euler/problem_10/sol1.py diff --git a/project_euler/Problem 11/grid.txt b/project_euler/problem_11/grid.txt similarity index 100% rename from project_euler/Problem 11/grid.txt rename to project_euler/problem_11/grid.txt diff --git a/project_euler/Problem 11/sol1.py b/project_euler/problem_11/sol1.py similarity index 100% rename from project_euler/Problem 11/sol1.py rename to project_euler/problem_11/sol1.py diff --git a/project_euler/Problem 11/sol2.py b/project_euler/problem_11/sol2.py similarity index 100% rename from project_euler/Problem 11/sol2.py rename to project_euler/problem_11/sol2.py diff --git a/project_euler/Problem 12/sol1.py b/project_euler/problem_12/sol1.py similarity index 100% rename from project_euler/Problem 12/sol1.py rename to project_euler/problem_12/sol1.py diff --git a/project_euler/Problem 13/sol1.py b/project_euler/problem_13/sol1.py similarity index 100% rename from project_euler/Problem 13/sol1.py rename to project_euler/problem_13/sol1.py diff --git a/project_euler/Problem 14/sol1.py b/project_euler/problem_14/sol1.py similarity index 100% rename from project_euler/Problem 14/sol1.py rename to project_euler/problem_14/sol1.py diff --git a/project_euler/Problem 15/sol1.py b/project_euler/problem_15/sol1.py similarity index 100% rename from project_euler/Problem 15/sol1.py rename to project_euler/problem_15/sol1.py diff --git a/project_euler/Problem 16/sol1.py b/project_euler/problem_16/sol1.py similarity index 100% rename from project_euler/Problem 16/sol1.py rename to project_euler/problem_16/sol1.py diff --git a/project_euler/Problem 17/sol1.py b/project_euler/problem_17/sol1.py similarity index 100% rename from project_euler/Problem 17/sol1.py rename to project_euler/problem_17/sol1.py diff --git a/project_euler/Problem 19/sol1.py b/project_euler/problem_19/sol1.py similarity index 100% rename from project_euler/Problem 19/sol1.py rename to project_euler/problem_19/sol1.py diff --git a/project_euler/Problem 20/sol1.py b/project_euler/problem_20/sol1.py similarity index 100% rename from project_euler/Problem 20/sol1.py rename to project_euler/problem_20/sol1.py diff --git a/project_euler/Problem 20/sol2.py b/project_euler/problem_20/sol2.py similarity index 100% rename from project_euler/Problem 20/sol2.py rename to project_euler/problem_20/sol2.py diff --git a/project_euler/Problem 21/sol1.py b/project_euler/problem_21/sol1.py similarity index 100% rename from project_euler/Problem 21/sol1.py rename to project_euler/problem_21/sol1.py diff --git a/project_euler/Problem 22/p022_names.txt b/project_euler/problem_22/p022_names.txt similarity index 100% rename from project_euler/Problem 22/p022_names.txt rename to project_euler/problem_22/p022_names.txt diff --git a/project_euler/Problem 22/sol1.py b/project_euler/problem_22/sol1.py similarity index 100% rename from project_euler/Problem 22/sol1.py rename to project_euler/problem_22/sol1.py diff --git a/project_euler/Problem 22/sol2.py b/project_euler/problem_22/sol2.py similarity index 100% rename from project_euler/Problem 22/sol2.py rename to project_euler/problem_22/sol2.py diff --git a/project_euler/Problem 24/sol1.py b/project_euler/problem_24/sol1.py similarity index 100% rename from project_euler/Problem 24/sol1.py rename to project_euler/problem_24/sol1.py diff --git a/project_euler/Problem 25/sol1.py b/project_euler/problem_25/sol1.py similarity index 100% rename from project_euler/Problem 25/sol1.py rename to project_euler/problem_25/sol1.py diff --git a/project_euler/Problem 28/sol1.py b/project_euler/problem_28/sol1.py similarity index 100% rename from project_euler/Problem 28/sol1.py rename to project_euler/problem_28/sol1.py diff --git a/project_euler/Problem 29/solution.py b/project_euler/problem_29/solution.py similarity index 100% rename from project_euler/Problem 29/solution.py rename to project_euler/problem_29/solution.py diff --git a/project_euler/Problem 36/sol1.py b/project_euler/problem_36/sol1.py similarity index 100% rename from project_euler/Problem 36/sol1.py rename to project_euler/problem_36/sol1.py diff --git a/project_euler/Problem 40/sol1.py b/project_euler/problem_40/sol1.py similarity index 100% rename from project_euler/Problem 40/sol1.py rename to project_euler/problem_40/sol1.py diff --git a/project_euler/Problem 48/sol1.py b/project_euler/problem_48/sol1.py similarity index 100% rename from project_euler/Problem 48/sol1.py rename to project_euler/problem_48/sol1.py diff --git a/project_euler/Problem 52/sol1.py b/project_euler/problem_52/sol1.py similarity index 100% rename from project_euler/Problem 52/sol1.py rename to project_euler/problem_52/sol1.py diff --git a/project_euler/Problem 53/sol1.py b/project_euler/problem_53/sol1.py similarity index 100% rename from project_euler/Problem 53/sol1.py rename to project_euler/problem_53/sol1.py diff --git a/project_euler/Problem 76/sol1.py b/project_euler/problem_76/sol1.py similarity index 100% rename from project_euler/Problem 76/sol1.py rename to project_euler/problem_76/sol1.py diff --git a/project_euler/Problem 9/sol1.py b/project_euler/problem_9/sol1.py similarity index 100% rename from project_euler/Problem 9/sol1.py rename to project_euler/problem_9/sol1.py diff --git a/project_euler/Problem 9/sol2.py b/project_euler/problem_9/sol2.py similarity index 100% rename from project_euler/Problem 9/sol2.py rename to project_euler/problem_9/sol2.py From eaffd812aa15c88c00bc0990a4ee716d87d7f3e7 Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Mon, 1 Oct 2018 00:06:33 +0300 Subject: [PATCH 3/7] final source file naming fix --- ...LUdecomposition.py => lu_decomposition.py} | 0 .../{NewtonMethod.py => newton_method.py} | 0 ...hsonMethod.py => newton_raphson_method.py} | 0 ...{QuineMcCluskey.py => quine_mc_cluskey.py} | 0 .../{FenwickTree.py => fenwick_tree.py} | 0 ...azySegmentTree.py => lazy_segment_tree.py} | 0 .../{SegmentTree.py => segment_tree.py} | 0 .../BellmanFord.py => graph/bellman_ford.py} | 0 .../breadth_first_search.py} | 0 .../depth_first_search.py} | 0 .../floyd_warshall.py} | 0 ...blyLinkedList.py => doubly_linked_list.py} | 0 ...ly_LinkedList.py => singly_linked_list.py} | 0 .../QueueOnList.py => queue/queue_on_list.py} | 90 ++++++++-------- .../queue_on_pseudo_stack.py} | 100 +++++++++--------- .../{FloydWarshall.py => floyd_warshall.py} | 74 ++++++------- .../modular_exponential.py | 0 Maths/SimpsonRule.py => maths/simpson_rule.py | 0 .../trapezoidal_rule.py | 0 other/{FindingPrimes.py => finding_primes.py} | 0 ...es_Shuffle.py => fischer_yates_shuffle.py} | 0 ...or.py => linear_congruential_generator.py} | 0 sorts/{external-sort.py => external_sort.py} | 0 ...-morris-pratt.py => knuth_morris_pratt.py} | 0 ...rsion.py => min_cost_string_conversion.py} | 0 strings/{rabin-karp.py => rabin_karp.py} | 0 26 files changed, 132 insertions(+), 132 deletions(-) rename arithmetic_analysis/{LUdecomposition.py => lu_decomposition.py} (100%) rename arithmetic_analysis/{NewtonMethod.py => newton_method.py} (100%) rename arithmetic_analysis/{NewtonRaphsonMethod.py => newton_raphson_method.py} (100%) rename boolean_algebra/quine_mc_cluskey/{QuineMcCluskey.py => quine_mc_cluskey.py} (100%) rename data_structures/binary_tree/{FenwickTree.py => fenwick_tree.py} (100%) rename data_structures/binary_tree/{LazySegmentTree.py => lazy_segment_tree.py} (100%) rename data_structures/binary_tree/{SegmentTree.py => segment_tree.py} (100%) rename data_structures/{Graph/BellmanFord.py => graph/bellman_ford.py} (100%) rename data_structures/{Graph/BreadthFirstSearch.py => graph/breadth_first_search.py} (100%) rename data_structures/{Graph/DepthFirstSearch.py => graph/depth_first_search.py} (100%) rename data_structures/{Graph/FloydWarshall.py => graph/floyd_warshall.py} (100%) rename data_structures/linked_list/{DoublyLinkedList.py => doubly_linked_list.py} (100%) rename data_structures/linked_list/{singly_LinkedList.py => singly_linked_list.py} (100%) rename data_structures/{Queue/QueueOnList.py => queue/queue_on_list.py} (96%) rename data_structures/{Queue/QueueOnPseudoStack.py => queue/queue_on_pseudo_stack.py} (96%) rename dynamic_programming/{FloydWarshall.py => floyd_warshall.py} (96%) rename Maths/ModularExponential.py => maths/modular_exponential.py (100%) rename Maths/SimpsonRule.py => maths/simpson_rule.py (100%) rename Maths/TrapezoidalRule.py => maths/trapezoidal_rule.py (100%) rename other/{FindingPrimes.py => finding_primes.py} (100%) rename other/{Fischer-Yates_Shuffle.py => fischer_yates_shuffle.py} (100%) rename other/{LinearCongruentialGenerator.py => linear_congruential_generator.py} (100%) rename sorts/{external-sort.py => external_sort.py} (100%) rename strings/{knuth-morris-pratt.py => knuth_morris_pratt.py} (100%) rename strings/{min-cost-string-conversion.py => min_cost_string_conversion.py} (100%) rename strings/{rabin-karp.py => rabin_karp.py} (100%) diff --git a/arithmetic_analysis/LUdecomposition.py b/arithmetic_analysis/lu_decomposition.py similarity index 100% rename from arithmetic_analysis/LUdecomposition.py rename to arithmetic_analysis/lu_decomposition.py diff --git a/arithmetic_analysis/NewtonMethod.py b/arithmetic_analysis/newton_method.py similarity index 100% rename from arithmetic_analysis/NewtonMethod.py rename to arithmetic_analysis/newton_method.py diff --git a/arithmetic_analysis/NewtonRaphsonMethod.py b/arithmetic_analysis/newton_raphson_method.py similarity index 100% rename from arithmetic_analysis/NewtonRaphsonMethod.py rename to arithmetic_analysis/newton_raphson_method.py diff --git a/boolean_algebra/quine_mc_cluskey/QuineMcCluskey.py b/boolean_algebra/quine_mc_cluskey/quine_mc_cluskey.py similarity index 100% rename from boolean_algebra/quine_mc_cluskey/QuineMcCluskey.py rename to boolean_algebra/quine_mc_cluskey/quine_mc_cluskey.py diff --git a/data_structures/binary_tree/FenwickTree.py b/data_structures/binary_tree/fenwick_tree.py similarity index 100% rename from data_structures/binary_tree/FenwickTree.py rename to data_structures/binary_tree/fenwick_tree.py diff --git a/data_structures/binary_tree/LazySegmentTree.py b/data_structures/binary_tree/lazy_segment_tree.py similarity index 100% rename from data_structures/binary_tree/LazySegmentTree.py rename to data_structures/binary_tree/lazy_segment_tree.py diff --git a/data_structures/binary_tree/SegmentTree.py b/data_structures/binary_tree/segment_tree.py similarity index 100% rename from data_structures/binary_tree/SegmentTree.py rename to data_structures/binary_tree/segment_tree.py diff --git a/data_structures/Graph/BellmanFord.py b/data_structures/graph/bellman_ford.py similarity index 100% rename from data_structures/Graph/BellmanFord.py rename to data_structures/graph/bellman_ford.py diff --git a/data_structures/Graph/BreadthFirstSearch.py b/data_structures/graph/breadth_first_search.py similarity index 100% rename from data_structures/Graph/BreadthFirstSearch.py rename to data_structures/graph/breadth_first_search.py diff --git a/data_structures/Graph/DepthFirstSearch.py b/data_structures/graph/depth_first_search.py similarity index 100% rename from data_structures/Graph/DepthFirstSearch.py rename to data_structures/graph/depth_first_search.py diff --git a/data_structures/Graph/FloydWarshall.py b/data_structures/graph/floyd_warshall.py similarity index 100% rename from data_structures/Graph/FloydWarshall.py rename to data_structures/graph/floyd_warshall.py diff --git a/data_structures/linked_list/DoublyLinkedList.py b/data_structures/linked_list/doubly_linked_list.py similarity index 100% rename from data_structures/linked_list/DoublyLinkedList.py rename to data_structures/linked_list/doubly_linked_list.py diff --git a/data_structures/linked_list/singly_LinkedList.py b/data_structures/linked_list/singly_linked_list.py similarity index 100% rename from data_structures/linked_list/singly_LinkedList.py rename to data_structures/linked_list/singly_linked_list.py diff --git a/data_structures/Queue/QueueOnList.py b/data_structures/queue/queue_on_list.py similarity index 96% rename from data_structures/Queue/QueueOnList.py rename to data_structures/queue/queue_on_list.py index c8d0b41de5d5..2070274e2c55 100644 --- a/data_structures/Queue/QueueOnList.py +++ b/data_structures/queue/queue_on_list.py @@ -1,45 +1,45 @@ -"""Queue represented by a python list""" -class Queue(): - def __init__(self): - self.entries = [] - self.length = 0 - self.front=0 - - def __str__(self): - printed = '<' + str(self.entries)[1:-1] + '>' - return printed - - """Enqueues {@code item} - @param item - item to enqueue""" - def put(self, item): - self.entries.append(item) - self.length = self.length + 1 - - - """Dequeues {@code item} - @requirement: |self.length| > 0 - @return dequeued - item that was dequeued""" - def get(self): - self.length = self.length - 1 - dequeued = self.entries[self.front] - self.front-=1 - self.entries = self.entries[self.front:] - return dequeued - - """Rotates the queue {@code rotation} times - @param rotation - number of times to rotate queue""" - def rotate(self, rotation): - for i in range(rotation): - self.put(self.get()) - - """Enqueues {@code item} - @return item at front of self.entries""" - def front(self): - return self.entries[0] - - """Returns the length of this.entries""" - def size(self): - return self.length +"""Queue represented by a python list""" +class Queue(): + def __init__(self): + self.entries = [] + self.length = 0 + self.front=0 + + def __str__(self): + printed = '<' + str(self.entries)[1:-1] + '>' + return printed + + """Enqueues {@code item} + @param item + item to enqueue""" + def put(self, item): + self.entries.append(item) + self.length = self.length + 1 + + + """Dequeues {@code item} + @requirement: |self.length| > 0 + @return dequeued + item that was dequeued""" + def get(self): + self.length = self.length - 1 + dequeued = self.entries[self.front] + self.front-=1 + self.entries = self.entries[self.front:] + return dequeued + + """Rotates the queue {@code rotation} times + @param rotation + number of times to rotate queue""" + def rotate(self, rotation): + for i in range(rotation): + self.put(self.get()) + + """Enqueues {@code item} + @return item at front of self.entries""" + def front(self): + return self.entries[0] + + """Returns the length of this.entries""" + def size(self): + return self.length diff --git a/data_structures/Queue/QueueOnPseudoStack.py b/data_structures/queue/queue_on_pseudo_stack.py similarity index 96% rename from data_structures/Queue/QueueOnPseudoStack.py rename to data_structures/queue/queue_on_pseudo_stack.py index b69fbcc988f7..fe302736e8d2 100644 --- a/data_structures/Queue/QueueOnPseudoStack.py +++ b/data_structures/queue/queue_on_pseudo_stack.py @@ -1,50 +1,50 @@ -"""Queue represented by a pseudo stack (represented by a list with pop and append)""" -class Queue(): - def __init__(self): - self.stack = [] - self.length = 0 - - def __str__(self): - printed = '<' + str(self.stack)[1:-1] + '>' - return printed - - """Enqueues {@code item} - @param item - item to enqueue""" - def put(self, item): - self.stack.append(item) - self.length = self.length + 1 - - """Dequeues {@code item} - @requirement: |self.length| > 0 - @return dequeued - item that was dequeued""" - def get(self): - self.rotate(1) - dequeued = self.stack[self.length-1] - self.stack = self.stack[:-1] - self.rotate(self.length-1) - self.length = self.length -1 - return dequeued - - """Rotates the queue {@code rotation} times - @param rotation - number of times to rotate queue""" - def rotate(self, rotation): - for i in range(rotation): - temp = self.stack[0] - self.stack = self.stack[1:] - self.put(temp) - self.length = self.length - 1 - - """Reports item at the front of self - @return item at front of self.stack""" - def front(self): - front = self.get() - self.put(front) - self.rotate(self.length-1) - return front - - """Returns the length of this.stack""" - def size(self): - return self.length +"""Queue represented by a pseudo stack (represented by a list with pop and append)""" +class Queue(): + def __init__(self): + self.stack = [] + self.length = 0 + + def __str__(self): + printed = '<' + str(self.stack)[1:-1] + '>' + return printed + + """Enqueues {@code item} + @param item + item to enqueue""" + def put(self, item): + self.stack.append(item) + self.length = self.length + 1 + + """Dequeues {@code item} + @requirement: |self.length| > 0 + @return dequeued + item that was dequeued""" + def get(self): + self.rotate(1) + dequeued = self.stack[self.length-1] + self.stack = self.stack[:-1] + self.rotate(self.length-1) + self.length = self.length -1 + return dequeued + + """Rotates the queue {@code rotation} times + @param rotation + number of times to rotate queue""" + def rotate(self, rotation): + for i in range(rotation): + temp = self.stack[0] + self.stack = self.stack[1:] + self.put(temp) + self.length = self.length - 1 + + """Reports item at the front of self + @return item at front of self.stack""" + def front(self): + front = self.get() + self.put(front) + self.rotate(self.length-1) + return front + + """Returns the length of this.stack""" + def size(self): + return self.length diff --git a/dynamic_programming/FloydWarshall.py b/dynamic_programming/floyd_warshall.py similarity index 96% rename from dynamic_programming/FloydWarshall.py rename to dynamic_programming/floyd_warshall.py index 038499ca03b6..0f4e16cd91d7 100644 --- a/dynamic_programming/FloydWarshall.py +++ b/dynamic_programming/floyd_warshall.py @@ -1,37 +1,37 @@ -import math - -class Graph: - - def __init__(self, N = 0): # a graph with Node 0,1,...,N-1 - self.N = N - self.W = [[math.inf for j in range(0,N)] for i in range(0,N)] # adjacency matrix for weight - self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j - - def addEdge(self, u, v, w): - self.dp[u][v] = w - - def floyd_warshall(self): - for k in range(0,self.N): - for i in range(0,self.N): - for j in range(0,self.N): - self.dp[i][j] = min(self.dp[i][j], self.dp[i][k] + self.dp[k][j]) - - def showMin(self, u, v): - return self.dp[u][v] - -if __name__ == '__main__': - graph = Graph(5) - graph.addEdge(0,2,9) - graph.addEdge(0,4,10) - graph.addEdge(1,3,5) - graph.addEdge(2,3,7) - graph.addEdge(3,0,10) - graph.addEdge(3,1,2) - graph.addEdge(3,2,1) - graph.addEdge(3,4,6) - graph.addEdge(4,1,3) - graph.addEdge(4,2,4) - graph.addEdge(4,3,9) - graph.floyd_warshall() - graph.showMin(1,4) - graph.showMin(0,3) +import math + +class Graph: + + def __init__(self, N = 0): # a graph with Node 0,1,...,N-1 + self.N = N + self.W = [[math.inf for j in range(0,N)] for i in range(0,N)] # adjacency matrix for weight + self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j + + def addEdge(self, u, v, w): + self.dp[u][v] = w + + def floyd_warshall(self): + for k in range(0,self.N): + for i in range(0,self.N): + for j in range(0,self.N): + self.dp[i][j] = min(self.dp[i][j], self.dp[i][k] + self.dp[k][j]) + + def showMin(self, u, v): + return self.dp[u][v] + +if __name__ == '__main__': + graph = Graph(5) + graph.addEdge(0,2,9) + graph.addEdge(0,4,10) + graph.addEdge(1,3,5) + graph.addEdge(2,3,7) + graph.addEdge(3,0,10) + graph.addEdge(3,1,2) + graph.addEdge(3,2,1) + graph.addEdge(3,4,6) + graph.addEdge(4,1,3) + graph.addEdge(4,2,4) + graph.addEdge(4,3,9) + graph.floyd_warshall() + graph.showMin(1,4) + graph.showMin(0,3) diff --git a/Maths/ModularExponential.py b/maths/modular_exponential.py similarity index 100% rename from Maths/ModularExponential.py rename to maths/modular_exponential.py diff --git a/Maths/SimpsonRule.py b/maths/simpson_rule.py similarity index 100% rename from Maths/SimpsonRule.py rename to maths/simpson_rule.py diff --git a/Maths/TrapezoidalRule.py b/maths/trapezoidal_rule.py similarity index 100% rename from Maths/TrapezoidalRule.py rename to maths/trapezoidal_rule.py diff --git a/other/FindingPrimes.py b/other/finding_primes.py similarity index 100% rename from other/FindingPrimes.py rename to other/finding_primes.py diff --git a/other/Fischer-Yates_Shuffle.py b/other/fischer_yates_shuffle.py similarity index 100% rename from other/Fischer-Yates_Shuffle.py rename to other/fischer_yates_shuffle.py diff --git a/other/LinearCongruentialGenerator.py b/other/linear_congruential_generator.py similarity index 100% rename from other/LinearCongruentialGenerator.py rename to other/linear_congruential_generator.py diff --git a/sorts/external-sort.py b/sorts/external_sort.py similarity index 100% rename from sorts/external-sort.py rename to sorts/external_sort.py diff --git a/strings/knuth-morris-pratt.py b/strings/knuth_morris_pratt.py similarity index 100% rename from strings/knuth-morris-pratt.py rename to strings/knuth_morris_pratt.py diff --git a/strings/min-cost-string-conversion.py b/strings/min_cost_string_conversion.py similarity index 100% rename from strings/min-cost-string-conversion.py rename to strings/min_cost_string_conversion.py diff --git a/strings/rabin-karp.py b/strings/rabin_karp.py similarity index 100% rename from strings/rabin-karp.py rename to strings/rabin_karp.py From 0391f50106e5ad320575fcdaf3ec3cdc5a74dcf0 Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Mon, 1 Oct 2018 00:07:51 +0300 Subject: [PATCH 4/7] change dashes to underscores --- linear-algebra-python/src/lib.pyc | Bin 11098 -> 0 bytes .../README.md | 0 .../src/lib.py | 0 .../src/tests.py | 0 .../README.md | 0 .../client.py | 0 .../server.py | 0 7 files changed, 0 insertions(+), 0 deletions(-) delete mode 100644 linear-algebra-python/src/lib.pyc rename {linear-algebra-python => linear_algebra_python}/README.md (100%) rename {linear-algebra-python => linear_algebra_python}/src/lib.py (100%) rename {linear-algebra-python => linear_algebra_python}/src/tests.py (100%) rename {simple-client-server => simple_client_server}/README.md (100%) rename {simple-client-server => simple_client_server}/client.py (100%) rename {simple-client-server => simple_client_server}/server.py (100%) diff --git a/linear-algebra-python/src/lib.pyc b/linear-algebra-python/src/lib.pyc deleted file mode 100644 index 7aeca0e1c6d56244f23a07bdeb3a1cf9cfa4ce82..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 11098 zcmd5?O>-Pa8SdF#t+Z>|Q6k455S+GSqE#Z9*aVvhhZtL-3X;gh$l$VwvW#{|(%7q6 zX?oUPxoi%Y;tG|5fZmpD6 zdyFqD71gdvWlXilrBYSxiF`uMO&C}0x^z!);pN65?uYeN{aO+RY1r1?Sighki{YBS za8aLsb>YHm3+K=43$L92Y`uOZ=%t(8WISDxtH_`1d z=tS{G{a%!AYSh9Y(LrY;TuTBS#d>=eCyCG1>(}pw$=xWtw@|Oo+vW7v!dBW%@S3lv z?}tg(wl><)77mJSW(NoK;wZfun8@rMHMiY0LnDL!_HM(pf=-ak-Ia~bXMZnnoLor1 z6QoJh$E(@t1xdJq?QK(IX|^8y9sicnDrj$ab0PpnsHpJ@< z{Igd|!tEq9VVr_l+Fo3D*L9GrMQIZ3Y7^ZL&$)@Wx;-6-kf*e(H=?_tPB+7RR;#-%-agV>$X{NV_XF?WzwWab~lP;^#TOOq_g-Nfv*F5yNM=D zM^9*N2Jr?2a`buK{ALsTHk%FZk#?8C?RZ1mbGk9^K#fRFlFlyZjS%$X+R;43+Ktc+ zlLkqu*LL+Qvu**BRCaK)*g~ogoURe~w${Rgt!_C;Y|g>3*Xl&=x5IcN-ITSGFzqGK zF)k7I&=*3BJJLVAa>2~*c9;Ypv3?o%$XFk=+Yy!3ZR7^c7lTZ14YDChy?@+G7-#iJ zZ}mE9v<=hU zG@I^DMh=r!Wn0&a;pAQDggWeh$s4T>cS| z%TsqMDmj(Y!c+02N`Yl1h2C$8MO$vjLB5B1LpRPy6NmQ-ZkVAFgL+z={~!q_6#-zK zpk@2A}C6#=i z6JT>VI~GKQuUtlroAceROxx|8Sk*?WStBX zj$B5Cltr1d;||U=C-i~nk4fDU-BTx*M@xQ)RovYvrJ3YM@T&T`RS42StH4pPjDj5_ zEXfdA3k0*`%*)xOXhe-XSZ*WFeU% zBqJ~m(ra0O%Djr^AsXb8!`tn*cy6dYp_2(&O!RH^Sp{ieKW|_=i(nPeGjf!Da>UP| zV)d;5yf9X&#nq!!G$Oia)wC$il)4G2x-IQcsAWL|^9H87^N~@5S9z?pb+d#~5osn% zT5;$3wt{ri;`UCG+CC9?62SDf;CztSt^AwM#4c;^%oU3&H-pfJ**I9NEl28>{QfAknT2GD}=1$c)XqS>L!f= zyjQ_77z1c4rU@l^EAvAXjwYmJrWi1fKx%9Bhx!pm^tM8?pa)0j&A@s(CP2(VSsI#? zb0>hWdN21R(oN`_!>Vk0Z>vxxa~x;e>X{U)XP&KFzCk$gsb)S&E*KPSZzD(&M*2^) zhwA0yQG%QzvLJ<0a&nn0^Wbj7FY*u8J_}v&#G1_j)6EgCS)KH%VCb~hC{6zF*m~ka zvh~L};SdY{uWW5c>+4|>#`pgv=K3dana8u$Kgl5?4j*IfNxX!^+-!C+@*rN4@f@2?C1wy#a+aiqy#{Mo@rQNQ-YD zw@)|d7>jot86+*zAZ~@Cr0bn-kcy8H#i`}K$N`2AD1M>n77>VPRv2gmeY%xaES_cU zNn(MUH=7SJ(r_y^R`pH+wNH369+iFCJL6TT?8JXsGd_ahFQNhgu`s^4I!XT#%zUq; zcIqNFIdEr|__G*4M7)0@(6ZK;N3hVwLs)2ITmLaWFpV2SyYJ$!;fty~=e6>SxXbWx zI6NedzSU{g2b~ExUuK5BFpLT0$U0>hb6FByT*Z6`#nAOK@Ie5a`CCl(Ncf2q2ZO|+ z(Ssq!h-gtWww%=xPe9;?rq0M}GpF{c;O1s-?Hhpr#XM;b*Ladjd8BL)7 zaTd?9&@9fdpvV;`liENiDWXA46hW>|SG`)bR<9kY)oNq43H&`$d!|<1FUViQ6wB-k zIro4e%n)Mi!1=!jg_3g(JXB;e3`;fPXCR z=Zwo4S`G^L8e+vifmQtHS-il4Hs6{BRICFBh=WU+CmnrJ|AY0Ns8b{>e}Xr|CN=h~ zDEiaZqLVF@hiiBY=rTkbMBF45w8NPLQ3{d@@#5=)r214IFG8shE8e2!43O-P z1Q&UI2}knJvUmcq$%Z|N-=Cu?v%P19;*;J~2~;Pw^GB$@goZ&fCzs_FrdX(+y<&_Q zVRJQS5qw;jXuMVgsDM>U9R<~oXAs=Sx{f|MKIs{2=w<|)(tF*Es7BB9ZQIOl0WNuP zn5Svoa*Wh^X_nk%9@|WRH_8+Hf*;a1CD0 z{TsQ){78qY@QyKik8x@A=XU>vgen(uIaw^hY-~;r3Hu+Hjm6}9QF}x_TUzrRpry*- z{WrsCV>8{C1-H!yPjjSa`g=6l@@)7JrQE!E-8^94-UNAz0LF*@qTmc|3$Pq00oAa6 zO%tz@&uhwuq0F9r0|N&y`?#!e6m;$b28M={>X{%3R6F*V;!;`8lepP@M|1#wgZvfW z#kC0^(xG7)?FFEDIYEJJF17!jAj#%PBoQ~{_ZVbRWUS`Zth3A2XoiJSAE3f;1n$6h zGqkl?(#6$pW*z}tK_+kdck+I*WQ(gSxfw*t0yHhF6YwUJ9WkOpX@*NB#4%a+G|!J- zJaEKVmO;I!ZtfgItiucuPinq`VuC@+s9M^-o z1$A*um}T}au;727D za)BI%VdDI3K}t8{KS(=DjYNzE?M9Q0VaQ+cII=xeB%6sPB6^HkNB{-RW22#4=#EXc zzD$OQpO@qQB7po-dQ0wEE2)WohKOj&6j+s3)_6jj=jd-S5ZjT zE$QAHjS3ngCMfaJJ@%CMEWY6#LlAe&dlA{PI&x%He91c{Eo{|Z7EV(q2p6Ikzd^;~ z2Bj9k9E=sxp1+Vr`}G3?lQ&Y95L9<^HOU-`uTv@52c>u;@57fArYFv2N&%JPKJwi| zbRp9c$Pt7H5uu3KyH+(sjiliUWDc@vGhFtl*c39yT&g5EXdU_Et}Yj&B{PJL@cC;0~u~@CCNU(b#hoTq5fso z$o0{T{y2KhkkOPoRe8xVbPfzXR%#LIKAJ4GUrGL5mNF6gAy_&PTNFU@(dFuMxYa8M zb5(wv=Feb|PpR-{S%|kqPt@Xz$d`zqNS|g0g++3dg)B);d%Vg7j7sh(ME;(jbP%fESM1Gew}c@jg~))T!01`Ls9K%sJ0*sZ~^~QsU@p!cpb;_+&>Gl9~a7x8|N)H6RDkM>ZSgY%n~bL zQ^^9$1@O{$5qE#7aQ~m6ektj__h*e)$T((}`8|1B5@%0C85=dUSXND=CNW=k?KXZj v>2s_v=3^rr|+Ei`w*zP|7Yf{hL diff --git a/linear-algebra-python/README.md b/linear_algebra_python/README.md similarity index 100% rename from linear-algebra-python/README.md rename to linear_algebra_python/README.md diff --git a/linear-algebra-python/src/lib.py b/linear_algebra_python/src/lib.py similarity index 100% rename from linear-algebra-python/src/lib.py rename to linear_algebra_python/src/lib.py diff --git a/linear-algebra-python/src/tests.py b/linear_algebra_python/src/tests.py similarity index 100% rename from linear-algebra-python/src/tests.py rename to linear_algebra_python/src/tests.py diff --git a/simple-client-server/README.md b/simple_client_server/README.md similarity index 100% rename from simple-client-server/README.md rename to simple_client_server/README.md diff --git a/simple-client-server/client.py b/simple_client_server/client.py similarity index 100% rename from simple-client-server/client.py rename to simple_client_server/client.py diff --git a/simple-client-server/server.py b/simple_client_server/server.py similarity index 100% rename from simple-client-server/server.py rename to simple_client_server/server.py From 68d34cbf5bed097ff0cbcf0e8f399d99f2d0953d Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Tue, 2 Oct 2018 15:35:05 +0300 Subject: [PATCH 5/7] trying to solve some strange uppercase bug --- arithmetic_analysis/Bisection.py | 33 ----------------------------- arithmetic_analysis/Intersection.py | 16 -------------- 2 files changed, 49 deletions(-) delete mode 100644 arithmetic_analysis/Bisection.py delete mode 100644 arithmetic_analysis/Intersection.py diff --git a/arithmetic_analysis/Bisection.py b/arithmetic_analysis/Bisection.py deleted file mode 100644 index a6af547db03b..000000000000 --- a/arithmetic_analysis/Bisection.py +++ /dev/null @@ -1,33 +0,0 @@ -import math - - -def bisection(function, a, b): # finds where the function becomes 0 in [a,b] using bolzano - - start = a - end = b - if function(a) == 0: # one of the a or b is a root for the function - return a - elif function(b) == 0: - return b - elif function(a) * function(b) > 0: # if none of these are root and they are both positive or negative, - # then his algorithm can't find the root - print("couldn't find root in [a,b]") - return - else: - mid = (start + end) / 2 - while abs(start - mid) > 0.0000001: # until we achieve precise equals to 10^-7 - if function(mid) == 0: - return mid - elif function(mid) * function(start) < 0: - end = mid - else: - start = mid - mid = (start + end) / 2 - return mid - - -def f(x): - return math.pow(x, 3) - 2*x - 5 - - -print(bisection(f, 1, 1000)) diff --git a/arithmetic_analysis/Intersection.py b/arithmetic_analysis/Intersection.py deleted file mode 100644 index 22c50f2ecafd..000000000000 --- a/arithmetic_analysis/Intersection.py +++ /dev/null @@ -1,16 +0,0 @@ -import math - -def intersection(function,x0,x1): #function is the f we want to find its root and x0 and x1 are two random starting points - x_n = x0 - x_n1 = x1 - while True: - x_n2 = x_n1-(function(x_n1)/((function(x_n1)-function(x_n))/(x_n1-x_n))) - if abs(x_n2 - x_n1)<0.00001 : - return x_n2 - x_n=x_n1 - x_n1=x_n2 - -def f(x): - return math.pow(x,3)-2*x-5 - -print(intersection(f,3,3.5)) From adae7b9df56fb85b0d272e76f7f7743b5c5f8e3b Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Tue, 2 Oct 2018 15:36:07 +0300 Subject: [PATCH 6/7] still trying to solve the uppercase bug --- arithmetic_analysis/bbisection.py | 33 ++++++++++++++++++++++++++++ arithmetic_analysis/iintersection.py | 16 ++++++++++++++ 2 files changed, 49 insertions(+) create mode 100644 arithmetic_analysis/bbisection.py create mode 100644 arithmetic_analysis/iintersection.py diff --git a/arithmetic_analysis/bbisection.py b/arithmetic_analysis/bbisection.py new file mode 100644 index 000000000000..a6af547db03b --- /dev/null +++ b/arithmetic_analysis/bbisection.py @@ -0,0 +1,33 @@ +import math + + +def bisection(function, a, b): # finds where the function becomes 0 in [a,b] using bolzano + + start = a + end = b + if function(a) == 0: # one of the a or b is a root for the function + return a + elif function(b) == 0: + return b + elif function(a) * function(b) > 0: # if none of these are root and they are both positive or negative, + # then his algorithm can't find the root + print("couldn't find root in [a,b]") + return + else: + mid = (start + end) / 2 + while abs(start - mid) > 0.0000001: # until we achieve precise equals to 10^-7 + if function(mid) == 0: + return mid + elif function(mid) * function(start) < 0: + end = mid + else: + start = mid + mid = (start + end) / 2 + return mid + + +def f(x): + return math.pow(x, 3) - 2*x - 5 + + +print(bisection(f, 1, 1000)) diff --git a/arithmetic_analysis/iintersection.py b/arithmetic_analysis/iintersection.py new file mode 100644 index 000000000000..22c50f2ecafd --- /dev/null +++ b/arithmetic_analysis/iintersection.py @@ -0,0 +1,16 @@ +import math + +def intersection(function,x0,x1): #function is the f we want to find its root and x0 and x1 are two random starting points + x_n = x0 + x_n1 = x1 + while True: + x_n2 = x_n1-(function(x_n1)/((function(x_n1)-function(x_n))/(x_n1-x_n))) + if abs(x_n2 - x_n1)<0.00001 : + return x_n2 + x_n=x_n1 + x_n1=x_n2 + +def f(x): + return math.pow(x,3)-2*x-5 + +print(intersection(f,3,3.5)) From 1518bdc238cb1abce4ae60d6f4dc3c9d5b0bbb6d Mon Sep 17 00:00:00 2001 From: Nikos Giachoudis Date: Tue, 2 Oct 2018 15:37:18 +0300 Subject: [PATCH 7/7] renaming to correct names --- arithmetic_analysis/{bbisection.py => bisection.py} | 0 arithmetic_analysis/{iintersection.py => intersection.py} | 0 2 files changed, 0 insertions(+), 0 deletions(-) rename arithmetic_analysis/{bbisection.py => bisection.py} (100%) rename arithmetic_analysis/{iintersection.py => intersection.py} (100%) diff --git a/arithmetic_analysis/bbisection.py b/arithmetic_analysis/bisection.py similarity index 100% rename from arithmetic_analysis/bbisection.py rename to arithmetic_analysis/bisection.py diff --git a/arithmetic_analysis/iintersection.py b/arithmetic_analysis/intersection.py similarity index 100% rename from arithmetic_analysis/iintersection.py rename to arithmetic_analysis/intersection.py