From edb3d51ec259e80e4da596a4aaae27505def43bc Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Fri, 29 May 2020 23:26:28 +0000
Subject: [PATCH] formatting filenames d7af6fdc8cb08578de6980d412e6e1caca1a1bcf

---
 data_structure/{AVLtree.cpp => avltree.cpp}                       | 0
 data_structure/{Binary Search Tree.cpp => binary_search_tree.cpp} | 0
 data_structure/{Binaryheap.cpp => binaryheap.cpp}                 | 0
 ...using_Linked_List.cpp => circular_queue_using_linked_list.cpp} | 0
 ...tion_usingArray.cpp => linkedlist_implentation_usingarray.cpp} | 0
 data_structure/{List Array.cpp => list_array.cpp}                 | 0
 data_structure/{MorrisInorder.cpp => morrisinorder.cpp}           | 0
 data_structure/{Queue Using Array2.cpp => queue_using_array2.cpp} | 0
 .../{Queue Using Linked List.cpp => queue_using_linked_list.cpp}  | 0
 data_structure/{Stack Using Array.cpp => stack_using_array.cpp}   | 0
 .../{Stack Using Linked List.cpp => stack_using_linked_list.cpp}  | 0
 data_structure/{Tree.cpp => tree.cpp}                             | 0
 dynamic_programming/{0-1 Knapsack.cpp => 0_1_knapsack.cpp}        | 0
 dynamic_programming/{Bellman-Ford.cpp => bellman_ford.cpp}        | 0
 dynamic_programming/{Catalan-Numbers.cpp => catalan_numbers.cpp}  | 0
 dynamic_programming/{Coin-Change.cpp => coin_change.cpp}          | 0
 dynamic_programming/{Cut Rod.cpp => cut_rod.cpp}                  | 0
 dynamic_programming/{Edit Distance.cpp => edit_distance.cpp}      | 0
 .../{Egg-Dropping-Puzzle.cpp => egg_dropping_puzzle.cpp}          | 0
 .../{Fibonacci_Bottom_Up.cpp => fibonacci_bottom_up.cpp}          | 0
 .../{Fibonacci_Top_Down.cpp => fibonacci_top_down.cpp}            | 0
 dynamic_programming/{Floyd-Warshall.cpp => floyd_warshall.cpp}    | 0
 ...gest Common Subsequence.cpp => longest_common_subsequence.cpp} | 0
 ...reasing Subsequence.cpp => longest_increasing_subsequence.cpp} | 0
 ...nce (nlogn).cpp => longest_increasing_subsequence_(nlogn).cpp} | 0
 ...x-Chain-Multiplication.cpp => matrix_chain_multiplication.cpp} | 0
 graph/{BFS.cpp => bfs.cpp}                                        | 0
 graph/{DFS.cpp => dfs.cpp}                                        | 0
 graph/{Dijkstra.cpp => dijkstra.cpp}                              | 0
 graph/{Kruskal.cpp => kruskal.cpp}                                | 0
 graph/{Topological-Sort.cpp => topological_sort.cpp}              | 0
 greedy_algorithms/{Dijkstra.cpp => dijkstra.cpp}                  | 0
 greedy_algorithms/{Knapsack.cpp => knapsack.cpp}                  | 0
 ...nimum Spanning Tree.cpp => kruskals_minimum_spanning_tree.cpp} | 0
 ... Minimum Spanning Tree.cpp => prims_minimum_spanning_tree.cpp} | 0
 hashing/{Chaining.cpp => chaining.cpp}                            | 0
 .../{Array Left Rotation.cpp => array_left_rotation.cpp}          | 0
 .../{Array Right Rotation.cpp => array_right_rotation.cpp}        | 0
 .../{Circular Linked List.cpp => circular_linked_list.cpp}        | 0
 ...cular Queue Using Array.cpp => circular_queue_using_array.cpp} | 0
 ...{Intersection_of_2_arrays.cpp => intersection_of_2_arrays.cpp} | 0
 ...sing Recusion.cpp => reverse_a_linked_list_using_recusion.cpp} | 0
 .../{selectionSortLinkedList.cpp => selectionsortlinkedlist.cpp}  | 0
 .../{Union_of_2_arrays.cpp => union_of_2_arrays.cpp}              | 0
 range_queries/{FenwickTree.cpp => fenwicktree.cpp}                | 0
 range_queries/{MO.cpp => mo.cpp}                                  | 0
 range_queries/{segTree.cpp => segtree.cpp}                        | 0
 sorting/{Counting_Sort.cpp => counting_sort.cpp}                  | 0
 48 files changed, 0 insertions(+), 0 deletions(-)
 rename data_structure/{AVLtree.cpp => avltree.cpp} (100%)
 rename data_structure/{Binary Search Tree.cpp => binary_search_tree.cpp} (100%)
 rename data_structure/{Binaryheap.cpp => binaryheap.cpp} (100%)
 rename data_structure/{circular_Queue_using_Linked_List.cpp => circular_queue_using_linked_list.cpp} (100%)
 rename data_structure/{linkedList_implentation_usingArray.cpp => linkedlist_implentation_usingarray.cpp} (100%)
 rename data_structure/{List Array.cpp => list_array.cpp} (100%)
 rename data_structure/{MorrisInorder.cpp => morrisinorder.cpp} (100%)
 rename data_structure/{Queue Using Array2.cpp => queue_using_array2.cpp} (100%)
 rename data_structure/{Queue Using Linked List.cpp => queue_using_linked_list.cpp} (100%)
 rename data_structure/{Stack Using Array.cpp => stack_using_array.cpp} (100%)
 rename data_structure/{Stack Using Linked List.cpp => stack_using_linked_list.cpp} (100%)
 rename data_structure/{Tree.cpp => tree.cpp} (100%)
 rename dynamic_programming/{0-1 Knapsack.cpp => 0_1_knapsack.cpp} (100%)
 rename dynamic_programming/{Bellman-Ford.cpp => bellman_ford.cpp} (100%)
 rename dynamic_programming/{Catalan-Numbers.cpp => catalan_numbers.cpp} (100%)
 rename dynamic_programming/{Coin-Change.cpp => coin_change.cpp} (100%)
 rename dynamic_programming/{Cut Rod.cpp => cut_rod.cpp} (100%)
 rename dynamic_programming/{Edit Distance.cpp => edit_distance.cpp} (100%)
 rename dynamic_programming/{Egg-Dropping-Puzzle.cpp => egg_dropping_puzzle.cpp} (100%)
 rename dynamic_programming/{Fibonacci_Bottom_Up.cpp => fibonacci_bottom_up.cpp} (100%)
 rename dynamic_programming/{Fibonacci_Top_Down.cpp => fibonacci_top_down.cpp} (100%)
 rename dynamic_programming/{Floyd-Warshall.cpp => floyd_warshall.cpp} (100%)
 rename dynamic_programming/{Longest Common Subsequence.cpp => longest_common_subsequence.cpp} (100%)
 rename dynamic_programming/{Longest Increasing Subsequence.cpp => longest_increasing_subsequence.cpp} (100%)
 rename dynamic_programming/{Longest Increasing Subsequence (nlogn).cpp => longest_increasing_subsequence_(nlogn).cpp} (100%)
 rename dynamic_programming/{Matrix-Chain-Multiplication.cpp => matrix_chain_multiplication.cpp} (100%)
 rename graph/{BFS.cpp => bfs.cpp} (100%)
 rename graph/{DFS.cpp => dfs.cpp} (100%)
 rename graph/{Dijkstra.cpp => dijkstra.cpp} (100%)
 rename graph/{Kruskal.cpp => kruskal.cpp} (100%)
 rename graph/{Topological-Sort.cpp => topological_sort.cpp} (100%)
 rename greedy_algorithms/{Dijkstra.cpp => dijkstra.cpp} (100%)
 rename greedy_algorithms/{Knapsack.cpp => knapsack.cpp} (100%)
 rename greedy_algorithms/{Kruskals Minimum Spanning Tree.cpp => kruskals_minimum_spanning_tree.cpp} (100%)
 rename greedy_algorithms/{Prims Minimum Spanning Tree.cpp => prims_minimum_spanning_tree.cpp} (100%)
 rename hashing/{Chaining.cpp => chaining.cpp} (100%)
 rename operations_on_datastructures/{Array Left Rotation.cpp => array_left_rotation.cpp} (100%)
 rename operations_on_datastructures/{Array Right Rotation.cpp => array_right_rotation.cpp} (100%)
 rename operations_on_datastructures/{Circular Linked List.cpp => circular_linked_list.cpp} (100%)
 rename operations_on_datastructures/{Circular Queue Using Array.cpp => circular_queue_using_array.cpp} (100%)
 rename operations_on_datastructures/{Intersection_of_2_arrays.cpp => intersection_of_2_arrays.cpp} (100%)
 rename operations_on_datastructures/{Reverse a Linked List using Recusion.cpp => reverse_a_linked_list_using_recusion.cpp} (100%)
 rename operations_on_datastructures/{selectionSortLinkedList.cpp => selectionsortlinkedlist.cpp} (100%)
 rename operations_on_datastructures/{Union_of_2_arrays.cpp => union_of_2_arrays.cpp} (100%)
 rename range_queries/{FenwickTree.cpp => fenwicktree.cpp} (100%)
 rename range_queries/{MO.cpp => mo.cpp} (100%)
 rename range_queries/{segTree.cpp => segtree.cpp} (100%)
 rename sorting/{Counting_Sort.cpp => counting_sort.cpp} (100%)

diff --git a/data_structure/AVLtree.cpp b/data_structure/avltree.cpp
similarity index 100%
rename from data_structure/AVLtree.cpp
rename to data_structure/avltree.cpp
diff --git a/data_structure/Binary Search Tree.cpp b/data_structure/binary_search_tree.cpp
similarity index 100%
rename from data_structure/Binary Search Tree.cpp
rename to data_structure/binary_search_tree.cpp
diff --git a/data_structure/Binaryheap.cpp b/data_structure/binaryheap.cpp
similarity index 100%
rename from data_structure/Binaryheap.cpp
rename to data_structure/binaryheap.cpp
diff --git a/data_structure/circular_Queue_using_Linked_List.cpp b/data_structure/circular_queue_using_linked_list.cpp
similarity index 100%
rename from data_structure/circular_Queue_using_Linked_List.cpp
rename to data_structure/circular_queue_using_linked_list.cpp
diff --git a/data_structure/linkedList_implentation_usingArray.cpp b/data_structure/linkedlist_implentation_usingarray.cpp
similarity index 100%
rename from data_structure/linkedList_implentation_usingArray.cpp
rename to data_structure/linkedlist_implentation_usingarray.cpp
diff --git a/data_structure/List Array.cpp b/data_structure/list_array.cpp
similarity index 100%
rename from data_structure/List Array.cpp
rename to data_structure/list_array.cpp
diff --git a/data_structure/MorrisInorder.cpp b/data_structure/morrisinorder.cpp
similarity index 100%
rename from data_structure/MorrisInorder.cpp
rename to data_structure/morrisinorder.cpp
diff --git a/data_structure/Queue Using Array2.cpp b/data_structure/queue_using_array2.cpp
similarity index 100%
rename from data_structure/Queue Using Array2.cpp
rename to data_structure/queue_using_array2.cpp
diff --git a/data_structure/Queue Using Linked List.cpp b/data_structure/queue_using_linked_list.cpp
similarity index 100%
rename from data_structure/Queue Using Linked List.cpp
rename to data_structure/queue_using_linked_list.cpp
diff --git a/data_structure/Stack Using Array.cpp b/data_structure/stack_using_array.cpp
similarity index 100%
rename from data_structure/Stack Using Array.cpp
rename to data_structure/stack_using_array.cpp
diff --git a/data_structure/Stack Using Linked List.cpp b/data_structure/stack_using_linked_list.cpp
similarity index 100%
rename from data_structure/Stack Using Linked List.cpp
rename to data_structure/stack_using_linked_list.cpp
diff --git a/data_structure/Tree.cpp b/data_structure/tree.cpp
similarity index 100%
rename from data_structure/Tree.cpp
rename to data_structure/tree.cpp
diff --git a/dynamic_programming/0-1 Knapsack.cpp b/dynamic_programming/0_1_knapsack.cpp
similarity index 100%
rename from dynamic_programming/0-1 Knapsack.cpp
rename to dynamic_programming/0_1_knapsack.cpp
diff --git a/dynamic_programming/Bellman-Ford.cpp b/dynamic_programming/bellman_ford.cpp
similarity index 100%
rename from dynamic_programming/Bellman-Ford.cpp
rename to dynamic_programming/bellman_ford.cpp
diff --git a/dynamic_programming/Catalan-Numbers.cpp b/dynamic_programming/catalan_numbers.cpp
similarity index 100%
rename from dynamic_programming/Catalan-Numbers.cpp
rename to dynamic_programming/catalan_numbers.cpp
diff --git a/dynamic_programming/Coin-Change.cpp b/dynamic_programming/coin_change.cpp
similarity index 100%
rename from dynamic_programming/Coin-Change.cpp
rename to dynamic_programming/coin_change.cpp
diff --git a/dynamic_programming/Cut Rod.cpp b/dynamic_programming/cut_rod.cpp
similarity index 100%
rename from dynamic_programming/Cut Rod.cpp
rename to dynamic_programming/cut_rod.cpp
diff --git a/dynamic_programming/Edit Distance.cpp b/dynamic_programming/edit_distance.cpp
similarity index 100%
rename from dynamic_programming/Edit Distance.cpp
rename to dynamic_programming/edit_distance.cpp
diff --git a/dynamic_programming/Egg-Dropping-Puzzle.cpp b/dynamic_programming/egg_dropping_puzzle.cpp
similarity index 100%
rename from dynamic_programming/Egg-Dropping-Puzzle.cpp
rename to dynamic_programming/egg_dropping_puzzle.cpp
diff --git a/dynamic_programming/Fibonacci_Bottom_Up.cpp b/dynamic_programming/fibonacci_bottom_up.cpp
similarity index 100%
rename from dynamic_programming/Fibonacci_Bottom_Up.cpp
rename to dynamic_programming/fibonacci_bottom_up.cpp
diff --git a/dynamic_programming/Fibonacci_Top_Down.cpp b/dynamic_programming/fibonacci_top_down.cpp
similarity index 100%
rename from dynamic_programming/Fibonacci_Top_Down.cpp
rename to dynamic_programming/fibonacci_top_down.cpp
diff --git a/dynamic_programming/Floyd-Warshall.cpp b/dynamic_programming/floyd_warshall.cpp
similarity index 100%
rename from dynamic_programming/Floyd-Warshall.cpp
rename to dynamic_programming/floyd_warshall.cpp
diff --git a/dynamic_programming/Longest Common Subsequence.cpp b/dynamic_programming/longest_common_subsequence.cpp
similarity index 100%
rename from dynamic_programming/Longest Common Subsequence.cpp
rename to dynamic_programming/longest_common_subsequence.cpp
diff --git a/dynamic_programming/Longest Increasing Subsequence.cpp b/dynamic_programming/longest_increasing_subsequence.cpp
similarity index 100%
rename from dynamic_programming/Longest Increasing Subsequence.cpp
rename to dynamic_programming/longest_increasing_subsequence.cpp
diff --git a/dynamic_programming/Longest Increasing Subsequence (nlogn).cpp b/dynamic_programming/longest_increasing_subsequence_(nlogn).cpp
similarity index 100%
rename from dynamic_programming/Longest Increasing Subsequence (nlogn).cpp
rename to dynamic_programming/longest_increasing_subsequence_(nlogn).cpp
diff --git a/dynamic_programming/Matrix-Chain-Multiplication.cpp b/dynamic_programming/matrix_chain_multiplication.cpp
similarity index 100%
rename from dynamic_programming/Matrix-Chain-Multiplication.cpp
rename to dynamic_programming/matrix_chain_multiplication.cpp
diff --git a/graph/BFS.cpp b/graph/bfs.cpp
similarity index 100%
rename from graph/BFS.cpp
rename to graph/bfs.cpp
diff --git a/graph/DFS.cpp b/graph/dfs.cpp
similarity index 100%
rename from graph/DFS.cpp
rename to graph/dfs.cpp
diff --git a/graph/Dijkstra.cpp b/graph/dijkstra.cpp
similarity index 100%
rename from graph/Dijkstra.cpp
rename to graph/dijkstra.cpp
diff --git a/graph/Kruskal.cpp b/graph/kruskal.cpp
similarity index 100%
rename from graph/Kruskal.cpp
rename to graph/kruskal.cpp
diff --git a/graph/Topological-Sort.cpp b/graph/topological_sort.cpp
similarity index 100%
rename from graph/Topological-Sort.cpp
rename to graph/topological_sort.cpp
diff --git a/greedy_algorithms/Dijkstra.cpp b/greedy_algorithms/dijkstra.cpp
similarity index 100%
rename from greedy_algorithms/Dijkstra.cpp
rename to greedy_algorithms/dijkstra.cpp
diff --git a/greedy_algorithms/Knapsack.cpp b/greedy_algorithms/knapsack.cpp
similarity index 100%
rename from greedy_algorithms/Knapsack.cpp
rename to greedy_algorithms/knapsack.cpp
diff --git a/greedy_algorithms/Kruskals Minimum Spanning Tree.cpp b/greedy_algorithms/kruskals_minimum_spanning_tree.cpp
similarity index 100%
rename from greedy_algorithms/Kruskals Minimum Spanning Tree.cpp
rename to greedy_algorithms/kruskals_minimum_spanning_tree.cpp
diff --git a/greedy_algorithms/Prims Minimum Spanning Tree.cpp b/greedy_algorithms/prims_minimum_spanning_tree.cpp
similarity index 100%
rename from greedy_algorithms/Prims Minimum Spanning Tree.cpp
rename to greedy_algorithms/prims_minimum_spanning_tree.cpp
diff --git a/hashing/Chaining.cpp b/hashing/chaining.cpp
similarity index 100%
rename from hashing/Chaining.cpp
rename to hashing/chaining.cpp
diff --git a/operations_on_datastructures/Array Left Rotation.cpp b/operations_on_datastructures/array_left_rotation.cpp
similarity index 100%
rename from operations_on_datastructures/Array Left Rotation.cpp
rename to operations_on_datastructures/array_left_rotation.cpp
diff --git a/operations_on_datastructures/Array Right Rotation.cpp b/operations_on_datastructures/array_right_rotation.cpp
similarity index 100%
rename from operations_on_datastructures/Array Right Rotation.cpp
rename to operations_on_datastructures/array_right_rotation.cpp
diff --git a/operations_on_datastructures/Circular Linked List.cpp b/operations_on_datastructures/circular_linked_list.cpp
similarity index 100%
rename from operations_on_datastructures/Circular Linked List.cpp
rename to operations_on_datastructures/circular_linked_list.cpp
diff --git a/operations_on_datastructures/Circular Queue Using Array.cpp b/operations_on_datastructures/circular_queue_using_array.cpp
similarity index 100%
rename from operations_on_datastructures/Circular Queue Using Array.cpp
rename to operations_on_datastructures/circular_queue_using_array.cpp
diff --git a/operations_on_datastructures/Intersection_of_2_arrays.cpp b/operations_on_datastructures/intersection_of_2_arrays.cpp
similarity index 100%
rename from operations_on_datastructures/Intersection_of_2_arrays.cpp
rename to operations_on_datastructures/intersection_of_2_arrays.cpp
diff --git a/operations_on_datastructures/Reverse a Linked List using Recusion.cpp b/operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
similarity index 100%
rename from operations_on_datastructures/Reverse a Linked List using Recusion.cpp
rename to operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
diff --git a/operations_on_datastructures/selectionSortLinkedList.cpp b/operations_on_datastructures/selectionsortlinkedlist.cpp
similarity index 100%
rename from operations_on_datastructures/selectionSortLinkedList.cpp
rename to operations_on_datastructures/selectionsortlinkedlist.cpp
diff --git a/operations_on_datastructures/Union_of_2_arrays.cpp b/operations_on_datastructures/union_of_2_arrays.cpp
similarity index 100%
rename from operations_on_datastructures/Union_of_2_arrays.cpp
rename to operations_on_datastructures/union_of_2_arrays.cpp
diff --git a/range_queries/FenwickTree.cpp b/range_queries/fenwicktree.cpp
similarity index 100%
rename from range_queries/FenwickTree.cpp
rename to range_queries/fenwicktree.cpp
diff --git a/range_queries/MO.cpp b/range_queries/mo.cpp
similarity index 100%
rename from range_queries/MO.cpp
rename to range_queries/mo.cpp
diff --git a/range_queries/segTree.cpp b/range_queries/segtree.cpp
similarity index 100%
rename from range_queries/segTree.cpp
rename to range_queries/segtree.cpp
diff --git a/sorting/Counting_Sort.cpp b/sorting/counting_sort.cpp
similarity index 100%
rename from sorting/Counting_Sort.cpp
rename to sorting/counting_sort.cpp