Created
October 14, 2017 17:23
-
-
Save vaibhavsingh97/94c8997bd3857c3e2d073bb75fbafd27 to your computer and use it in GitHub Desktop.
git log
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [vaibhav@deathping cosmos]$ code . | |
| [vaibhav@deathping cosmos]$ git checkout Patch6 | |
| Switched to branch 'Patch6' | |
| Your branch is up-to-date with 'origin/Patch6'. | |
| [vaibhav@deathping cosmos]$ git checkout master | |
| Switched to branch 'master' | |
| Your branch is ahead of 'origin/master' by 1948 commits. | |
| (use "git push" to publish your local commits) | |
| [vaibhav@deathping cosmos]$ git pull upstream master | |
| remote: Counting objects: 5649, done. | |
| remote: Compressing objects: 100% (70/70), done. | |
| remote: Total 5649 (delta 1016), reused 1018 (delta 987), pack-reused 4592 | |
| Receiving objects: 100% (5649/5649), 837.44 KiB | 127.00 KiB/s, done. | |
| Resolving deltas: 100% (3667/3667), completed with 242 local objects. | |
| From https://github.com/OpenGenus/cosmos | |
| * branch master -> FETCH_HEAD | |
| f5b2188d..d3af480c master -> upstream/master | |
| Updating f5b2188d..d3af480c | |
| Fast-forward | |
| .github/CONTRIBUTING.md | 2 +- | |
| README.md | 2 +- | |
| .../Linear_Regression/LinearRegression.java | 60 + | |
| .../Logistic_Regression/Logistic_Regression.py | 62 + | |
| code/artificial_intelligence/SAT/togasat.cpp | 535 ++++++++ | |
| .../decision_tree/Decision_Tree.py | 172 +++ | |
| .../decision_tree/data_banknote_authentication.csv | 1372 ++++++++++++++++++++ | |
| .../factorization_machines/README.md | 12 + | |
| .../gaussian_mixture_model/README.md | 12 + | |
| .../gradient_boosting_trees/README.md | 12 + | |
| .../k_Nearest_Neighbours/iris.data | 151 +++ | |
| .../k_Nearest_Neighbours/k_Nearest_Neighbours.py | 76 ++ | |
| code/artificial_intelligence/k_means/README.md | 12 + | |
| code/artificial_intelligence/naive_bayes/README.md | 12 + | |
| .../principal_component_analysis/README.md | 12 + | |
| .../random_forests/README.md | 12 + | |
| .../restricted_boltzmann_machine/README.md | 12 + | |
| .../support_vector_machine/README.md | 12 + | |
| .../README.md | 12 + | |
| code/backtracking/algorithm-x/algo-x.cpp | 5 +- | |
| code/backtracking/knight_tour/knight_tour.cpp | 1 + | |
| code/backtracking/knight_tour/knight_tour.go | 84 ++ | |
| code/backtracking/knight_tour/knight_tour.java | 99 ++ | |
| code/backtracking/knight_tour/knight_tour.py | 65 + | |
| code/backtracking/knight_tour/knight_tour.rs | 117 ++ | |
| code/backtracking/n_queen/NQueen.java | 66 + | |
| code/backtracking/n_queen/Nqueen_Backtracking.rs | 116 ++ | |
| code/backtracking/n_queen/n _queen.c | 146 +++ | |
| code/backtracking/n_queen/nqueen.go | 80 ++ | |
| code/backtracking/n_queen/nqueen.py | 36 + | |
| code/backtracking/n_queen/nqueen_bit.go | 41 + | |
| .../number_of_ways_in_maze/no_of_ways_in_maze.go | 84 ++ | |
| .../partitions_of_number/partitions_of_number.cpp | 1 + | |
| .../partitions_of_number/partitions_of_number.go | 29 + | |
| .../partitions_of_set/set_partitions.cpp | 1 + | |
| .../partitions_of_set/set_partitions.go | 66 + | |
| .../permutations_of_string.go | 23 + | |
| .../permutations_of_string.kt | 37 + | |
| .../permutations_of_string.py | 14 + | |
| .../permutations_of_string_itertools.py | 11 + | |
| .../permutations_of_string_stl.cpp | 14 + | |
| code/backtracking/powerset/PowerSet.java | 92 ++ | |
| code/backtracking/subset_sum/subset_sum.go | 46 + | |
| code/backtracking/sudoku_solve/SudokuSolve.c | 137 ++ | |
| .../bit-manipulation/byte_swapper/ByteSwapper.java | 90 ++ | |
| .../convert_number_binary/README.md | 114 ++ | |
| .../convert_number_binary/convert_number_binary.c | 25 + | |
| .../convert_number_binary/convert_number_binary.hs | 76 ++ | |
| .../convert_number_binary.php | 90 ++ | |
| .../convert_number_binary/intToBinary.py | 18 + | |
| .../hamming_distance/hamming_distance.c | 50 + | |
| code/bit-manipulation/power_of_2/PowerOf2.java | 16 + | |
| code/bit-manipulation/power_of_2/power_of_2.c | 25 + | |
| code/bit-manipulation/power_of_2/power_of_2.cpp | 23 + | |
| code/bit-manipulation/power_of_2/power_of_2.js | 14 + | |
| code/bit-manipulation/power_of_2/power_of_2.py | 14 + | |
| code/bit-manipulation/power_of_2/power_of_2.rs | 19 + | |
| .../thrice_unique_number/thrice_unique_number.js | 22 + | |
| .../2d_line_intersection/README.md | 12 + | |
| .../2d_line_intersection/line.c | 68 + | |
| .../2d_line_intersection/line.java | 108 ++ | |
| .../2d_line_intersection/line.js | 67 + | |
| .../2d_line_intersection/line.py | 51 + | |
| .../2d_line_intersection/line2dintersection.hs | 183 +++ | |
| .../2d_separating_axis_test/sat.cpp | 88 ++ | |
| code/computational_geometry/README.md | 14 +- | |
| .../area_of_polygon/area_of_polygon.c | 41 + | |
| .../area_of_polygon/area_of_polygon.py | 23 + | |
| .../area_of_triangle/area_of_triangle.go | 31 + | |
| .../area_of_triangle/area_of_triangle.js | 11 + | |
| .../axis_aligned_bounding_box_collision.go | 42 + | |
| .../cohen_sutherland_lineclip/README.md | 27 + | |
| .../cohen_sutherland_lineclip/lineclip.c | 180 +++ | |
| .../distance_between_points.go | 29 + | |
| .../distance_between_points.py | 14 + | |
| .../graham_scan/graham_scan.cpp | 77 ++ | |
| .../graham_scan/graham_scan.java | 155 +++ | |
| .../jarvis_march/jarvis_march.cpp | 77 ++ | |
| .../quickhull/quickHull.java | 159 +++ | |
| .../computational_geometry/quickhull/quickhull.cpp | 94 ++ | |
| .../sutherland_hodgeman_clipping/README.md | 37 + | |
| .../sutherland_hodgeman_clipping/sutherland.c | 180 +++ | |
| code/cryptography/affine_cipher/affine.cpp | 78 ++ | |
| code/cryptography/affine_cipher/affine.py | 9 + | |
| code/cryptography/autokey_cipher/autokey.py | 53 + | |
| code/cryptography/baconian_cipher/baconian.php | 85 ++ | |
| code/cryptography/baconian_cipher/baconian.py | 17 + | |
| .../{ciphers => }/caesar_cipher/CaesarCipher.cs | 0 | |
| code/cryptography/caesar_cipher/caesar.c | 49 + | |
| .../columnar_transposition.cpp | 132 ++ | |
| code/cryptography/morse_cipher/MorseCode.java | 57 + | |
| code/cryptography/polybius_cipher/polybius.py | 58 + | |
| code/cryptography/porta_cipher/porta.py | 50 + | |
| code/cryptography/rail_fence_cipher/rail_fence.cpp | 99 ++ | |
| code/cryptography/rail_fence_cipher/rail_fence.rb | 172 +++ | |
| code/cryptography/rot13_cipher/RotN.java | 28 + | |
| code/cryptography/rot13_cipher/rot13.js | 5 + | |
| code/cryptography/rot13_cipher/rot13.py | 19 + | |
| code/cryptography/runningkey_cipher/runningkey.py | 55 + | |
| .../cryptography/vigenere_cipher/vigenere_cipher.c | 105 +- | |
| .../vigenere_cipher/vigenere_cipher.jl | 49 + | |
| .../vigenere_cipher/vigenere_cipher.js | 51 + | |
| .../vigenere_cipher/vigenere_cipher.php | 80 ++ | |
| code/data_structures/Heap/MaxHeap.cpp | 40 - | |
| .../{AVL_tree => avl_tree}/AVL_tree.cpp | 0 | |
| code/data_structures/{B_Tree => b_Tree}/B_Tree.cpp | 14 +- | |
| code/data_structures/b_tree/README.md | 3 - | |
| code/data_structures/bag/Bag.java | 125 ++ | |
| code/data_structures/binomial_heap/README.md | 3 - | |
| code/data_structures/binomial_heap/binomial_heap.c | 328 +++++ | |
| .../binomial_heap.cpp | 0 | |
| code/data_structures/fenwick_tree/fenwick_tree.cpp | 4 +- | |
| .../{Hash_Table => hash_table}/HashTable.java | 0 | |
| code/data_structures/hash_table/HashTable.js | 69 + | |
| code/data_structures/hash_table/README.md | 3 - | |
| code/data_structures/hash_table/hashtable.c | 135 ++ | |
| code/data_structures/hash_table/hashtable.cs | 94 ++ | |
| code/data_structures/hash_table/hashtable.go | 78 ++ | |
| code/data_structures/heap/MaxHeap.cpp | 179 +++ | |
| code/data_structures/{Heap => heap}/README.md | 0 | |
| code/data_structures/{Heap => heap}/max_heap.c | 0 | |
| code/data_structures/{Heap => heap}/max_heap.go | 14 +- | |
| code/data_structures/{Heap => heap}/max_heap.py | 0 | |
| code/data_structures/{Heap => heap}/minHeap.swift | 0 | |
| code/data_structures/{Heap => heap}/min_heap.cpp | 0 | |
| code/data_structures/{Heap => heap}/min_heap.py | 0 | |
| code/data_structures/{Heap => heap}/minheap.cpp | 0 | |
| code/data_structures/{Heap => heap}/minheap.java | 0 | |
| code/data_structures/interval_trees/Interval.java | 391 ++++++ | |
| .../interval_trees/interval_trees.cpp | 1 + | |
| code/data_structures/kd_tree/KDTree.cpp | 87 ++ | |
| code/data_structures/kd_tree/KDTree.java | 192 +++ | |
| .../LeftistPriorityQueue.cpp | 0 | |
| code/data_structures/leftist_tree/README.md | 3 - | |
| .../circular_linked_list/circular_linked_list.java | 155 +++ | |
| .../circular_linked_list/circular_linkedlist.py | 57 + | |
| .../doubly_linked_list/Doubly_linked_list.py | 95 ++ | |
| .../doubly_linked_list/doubly_linked_list.go | 66 + | |
| .../linked_list/linked_list/linked_list.rb | 110 ++ | |
| .../linked_list/linked_list/linked_list.swift | 71 + | |
| .../singly_linked_list_with_classes.cpp | 106 ++ | |
| code/data_structures/{Queue => queue}/README.md | 0 | |
| code/data_structures/queue/queue/Queue.cs | 143 ++ | |
| code/data_structures/queue/queue/queue.js | 48 + | |
| code/data_structures/queue/queue/queue.swift | 38 + | |
| .../queue/queue_using_stacks/QueueStacks.java | 144 ++ | |
| .../queue_using_stacks/queue_using_stacks.cpp | 86 ++ | |
| .../reverse_queue/reverse_queue.cpp | 0 | |
| .../reverse_queue/reverse_queue.java | 0 | |
| .../queue/reverse_queue/reverse_queue.py | 90 ++ | |
| .../queue/reverse_queue/reverse_queue.swift | 82 ++ | |
| .../red_black_tree/red_black_tree.cpp | 272 ++++ | |
| .../segment_tree_kth_statistics_on_segment.cpp | 94 ++ | |
| code/data_structures/skip_list/skip_list.cpp | 220 ++++ | |
| code/data_structures/splay_tree/splay_tree.kt | 152 +++ | |
| code/data_structures/{Stack => stack}/README.md | 0 | |
| .../infix_to_postfix/infix_to_postfix.c | 0 | |
| .../infix_to_postfix/infix_to_postfix.cpp | 0 | |
| .../infix_to_postfix/infix_to_postfix.py | 0 | |
| .../infix_to_postfix_evaluation.cpp | 0 | |
| .../stack/postfix_evaluation/postfix_evaluation.c | 95 ++ | |
| .../stack/postfix_evaluation/postfix_evaluation.sh | 65 + | |
| .../prefix_to_postfix/prefix_to_postfix.py | 0 | |
| .../stack/reverse_stack/reverseStack.java | 56 + | |
| .../stack/reverse_stack/reverse_stack.c | 138 ++ | |
| .../stack/reverse_stack/reverse_stack.cs | 64 + | |
| .../stack/reverse_stack/reverse_stack.py | 70 + | |
| .../stack/reverse_stack/reverse_stack.swift | 83 ++ | |
| .../reverse_stack_without_extra_space.cpp | 0 | |
| code/data_structures/stack/sort_stack/sort_stack.c | 132 ++ | |
| .../stack/sort_stack/sort_stack.cpp | 59 + | |
| code/data_structures/stack/stack/Stack.cs | 30 +- | |
| code/data_structures/stack/stack/Stack.php | 103 ++ | |
| code/data_structures/stack/stack/stack.swift | 35 + | |
| code/data_structures/treap/persistent_treap.kt | 194 +++ | |
| code/data_structures/tree/README.md | 3 - | |
| .../binary_search_tree/binary_search_tree.c | 0 | |
| .../binary_search_tree/binary_search_tree.cpp | 0 | |
| .../tree/binary_search_tree/binary_search_tree.go | 179 +-- | |
| .../binary_search_tree/binary_search_tree.js | 0 | |
| .../binary_search_tree/binary_search_tree.py | 0 | |
| .../binary_search_tree/binary_search_tree.rb | 0 | |
| .../tree/binary_search_tree_height/README.md | 3 - | |
| .../{Tree => tree}/binary_tree/BinaryTree.java | 0 | |
| .../bottom_view_binary_tree/Bottom_view.cpp | 0 | |
| .../bottom_view_binary_tree/Bottom_view.java | 0 | |
| .../binary_tree_diameter/binary_tree_diameter.c | 0 | |
| .../binary_tree_diameter/binary_tree_diameter.cpp | 0 | |
| .../binary_tree_diameter/diameter_binary_tree.java | 0 | |
| .../binary_tree_diameter/diameter_binary_tree.py | 0 | |
| .../binary_tree_diameter/diameter_tree.c | 0 | |
| .../BinaryTreeHeight.java | 0 | |
| .../binary_tree_maximum_height}/README.md | 0 | |
| .../binary_tree_height.py} | 0 | |
| .../binary_tree_height_1.cpp} | 0 | |
| .../binary_tree_height_2.cpp} | 0 | |
| .../binary_tree_minimum_height/min_depth.c | 0 | |
| .../binary_tree_minimum_height/min_height.py | 0 | |
| .../min_height_binary_tree.java | 33 + | |
| .../minimum_height_binary_tree.cpp | 0 | |
| .../binary_tree_mirror/Binary_Tree_Mirror.cpp | 0 | |
| .../binary_tree_mirror/MirrorElementsBst.py | 0 | |
| .../binary_tree_mirror/mirror_image.c | 0 | |
| .../balanced_or_not.java | 0 | |
| .../inorder_and_preorder_to_postorder.c | 0 | |
| .../inorder_and_preorder_to_postorder.cpp | 0 | |
| .../left_view_binary_tree/leftView.java | 0 | |
| .../MakeTreefromInorderAndPreorder.java | 0 | |
| .../right_threaded_binary_tree.cpp | 157 +++ | |
| .../right_view_binary_tree/right_view.cpp | 0 | |
| .../right_view_binary_tree/right_view.py | 0 | |
| .../right_view_binary_tree.cpp | 0 | |
| .../sum_left_leaves/sum_left_leaves.c | 0 | |
| code/data_structures/{Trie => trie}/Trie.c | 0 | |
| code/data_structures/trie/Trie.cs | 166 +++ | |
| code/data_structures/{Trie => trie}/Trie.java | 31 +- | |
| code/data_structures/{Trie => trie}/Trie.py | 10 +- | |
| .../{Trie => trie}/Trie_add_and_search.cpp | 0 | |
| code/data_structures/trie/trie.rb | 31 + | |
| code/data_structures/union_find/union_find.c | 86 ++ | |
| .../inversion_count/inversion_count.js | 67 + | |
| .../inversion_count/inversion_count.py | 45 + | |
| .../MergeSort.java | 93 ++ | |
| code/divide_conquer/quick_sort/QuickSort.java | 59 + | |
| code/divide_conquer/quick_sort/quick_sort.rs | 38 + | |
| code/dynamic_programming/Array_Median/median.php | 51 + | |
| code/dynamic_programming/Array_Median/median.py | 1 + | |
| code/dynamic_programming/Array_Median/median.rb | 10 + | |
| code/dynamic_programming/Array_Median/median.rs | 4 +- | |
| .../dynamic_programming/coin_change/coin_change.py | 32 + | |
| code/dynamic_programming/coin_change/coinchange.c | 44 + | |
| .../dynamic_programming/coin_change/coinchange.cpp | 57 +- | |
| code/dynamic_programming/coin_change/coinchange.go | 36 + | |
| .../edit_distance/edit_distance.hs | 25 +- | |
| .../egg_dropping_puzzle/eggDropping.hs | 18 + | |
| .../egg_dropping_puzzle/egg_dropping_puzzle.cpp | 2 +- | |
| code/dynamic_programming/knapsack/Knapsack.java | 45 + | |
| code/dynamic_programming/knapsack/knapsack.js | 49 + | |
| code/dynamic_programming/knapsack/knapsack.py | 38 + | |
| .../longest_bitonic_sequence.c | 87 ++ | |
| .../longestCommonSubsequence.go | 47 + | |
| .../longest_palindromic_sequence.c | 56 + | |
| .../longest_palindromic_sequence.cpp | 49 + | |
| .../longest_palindromic_sequence.js | 32 + | |
| .../longest_palindromic_sequence.py | 49 + | |
| .../LongestPalindromicSubstring.cpp | 64 + | |
| .../MatrixChainMultiplication.java | 54 + | |
| .../rod_cutting/rod_cutting.cpp | 21 +- | |
| .../dynamic_programming/rod_cutting/rod_cutting.hs | 9 + | |
| .../shortest_common_supersequence.cpp | 56 +- | |
| code/dynamic_programming/subset_sum/subset_sum.go | 56 + | |
| .../bellman_ford_algorithm/BellmanFord.java | 60 - | |
| .../BellmanFordAdjacencyList.java | 117 ++ | |
| .../BellmanFordEdgeList.java | 100 ++ | |
| .../bellman_ford_algorithm/README.md | 15 +- | |
| .../bellman_ford_algorithm/bellman_ford.c | 91 ++ | |
| .../bellman_ford_algorithm/bellman_ford.py | 2 + | |
| .../biconnected_components.cpp | 8 +- | |
| .../boruvka_minimum_spanning_tree.cpp | 95 ++ | |
| code/graph-algorithms/depth_first_search/Dfs.kt | 45 + | |
| .../TopologicalSortAdjacencyList.java | 147 +++ | |
| .../TopologicalSortAdjacencyMatrix.java | 125 ++ | |
| code/greedy-algorithms/README.md | 24 +- | |
| .../activity_selection/activity_selection.py | 40 + | |
| .../fractional_knapsack/fractional_knapsack.go | 63 + | |
| .../kruskal_minimum_spanning_tree/README.md | 13 +- | |
| .../kruskal_minimum_spanning_tree/kruskal.c | 183 +++ | |
| .../{FindindSquare.java => FindingSquare.java} | 11 +- | |
| .../EulerTotient/EulerTotient.java | 58 + | |
| .../armstrong_numbers/armstrong_numbers.java | 21 + | |
| .../automorphic_numbers/AutomorphicNumber.java | 32 + | |
| .../automorphic_numbers/README.md | 16 + | |
| .../automorphic_numbers/automorphic.cs | 30 + | |
| .../automorphic_numbers/automorphic.go | 22 + | |
| .../automorphic_numbers/automorphic.js | 24 + | |
| .../automorphic_numbers/automorphic.php | 40 + | |
| .../average_stream_numbers.cpp | 31 + | |
| .../average_stream_numbers.py | 13 + | |
| .../Greatest_digit_in_number.java | 20 + | |
| .../greatest_digit_in_number.php | 40 + | |
| .../greatest_digit_in_number.rb | 19 + | |
| .../smallest_digit_in_number.java | 22 + | |
| .../smallest_digit_in_number.php | 40 + | |
| .../smallest_digit_in_number.rb | 20 + | |
| .../basic/log_of_factorial/logfactorial.cpp | 20 + | |
| .../binomial_coefficient/binomialCoefficient.cpp | 25 + | |
| .../binomial_coefficient_modular.cpp | 54 + | |
| .../catalan_number/catalan_number_dynamic.cpp | 27 +- | |
| .../catalan_number/catalan_number_recursive.cpp | 35 +- | |
| .../coprime_numbers/coprime_numbers.cpp | 16 +- | |
| .../count_digits/Count_digits.java | 19 + | |
| .../count_digits/count_digits.cpp | 22 +- | |
| .../count_digits/count_digits.js | 13 + | |
| .../count_digits/count_digits.py | 12 + | |
| .../count_digits/count_digits.swift | 24 + | |
| .../count_trailing_zeros_factorial.js | 19 + | |
| .../diophantine/diophantine.cpp | 83 ++ | |
| .../exponentation_power_gnu_easy.cpp | 10 + | |
| .../modulo_exponentation_power.cpp | 17 + | |
| .../factorial/factorial.clj | 15 + | |
| .../factorial/factorial.erl | 5 + | |
| .../mathematical-algorithms/factorial/factorial.ex | 7 + | |
| .../mathematical-algorithms/factorial/factorial.go | 28 + | |
| .../mathematical-algorithms/factorial/factorial.js | 8 + | |
| .../factorial/factorial.php | 11 + | |
| .../mathematical-algorithms/factorial/factorial.rb | 10 + | |
| .../mathematical-algorithms/factorial/factorial.rs | 19 + | |
| .../factorial/factorial.swift | 6 + | |
| .../fast_fourier_transform/FFT.java | 92 ++ | |
| .../fast_inverse_sqrt/fast_inverse_sqrt.cpp | 26 + | |
| .../fibonacci_number/fibonacci.clj | 20 + | |
| .../fibonacci_number/fibonacci.java | 15 + | |
| .../fibonacci_number/fibonacci.swift | 11 + | |
| .../fibonacci_number/fibonacci_memorized.swift | 18 + | |
| .../gcd_and_lcm/gcd_and_lcm.c | 20 + | |
| .../gcd_and_lcm/gcd_and_lcm.go | 46 + | |
| .../gcd_and_lcm/gcd_and_lcm.php | 15 + | |
| .../gcd_and_lcm/gcd_gnu.cpp | 10 + | |
| .../gcd_and_lcm/gcdandlcm.cpp | 29 +- | |
| .../integer_conversion/decimal_to_any_base.js | 50 + | |
| .../integer_conversion/decimal_to_int.go | 27 + | |
| .../lexicographic_string_rank.c | 54 + | |
| .../lexicographic_string_rank.cpp | 65 + | |
| .../lexicographic_string_rank.py | 33 + | |
| .../lucky_number/lucky_number.java | 32 + | |
| .../modular_inverse/modular_inverse.java | 54 + | |
| .../modular_inverse/modular_inverse.rb | 20 + | |
| .../multiply_polynomial/FFT.cpp | 142 ++ | |
| .../next_larger_number/next_larger_number.php | 75 ++ | |
| .../pandigital_number/README.md | 11 + | |
| .../pandigital_number/pandigital_number.c | 104 ++ | |
| .../permutation_lexicographic_order.cpp | 36 + | |
| .../prime_factors/prime_factors.py | 26 + | |
| .../prime_numbers_of_n/prime_factors.py | 135 ++ | |
| .../reverse_factorial/reverse_factorial.java | 10 + | |
| .../reverse_factorial/reverse_factorial.js | 14 + | |
| .../reverse_factorial/reverse_factorial.py | 17 + | |
| .../reverse_number/Reverse.java | 28 + | |
| .../reverse_number/reverse_number.cpp | 32 +- | |
| .../reverse_number/reverse_number.py | 5 + | |
| .../reverse_number/reversed_number.swift | 15 + | |
| .../russian_peasant.rs | 18 + | |
| .../shuffle_array/arrayshuffle.rb | 34 + | |
| .../shuffle_array/shuffle_array.cpp | 13 + | |
| .../shuffle_array/shuffle_array.js | 11 + | |
| code/mathematical-algorithms/std/std.c | 33 + | |
| code/mathematical-algorithms/std/std.go | 47 + | |
| .../sum_of_digits/Sum_of_digits_function.py | 21 +- | |
| .../sum_of_digits/sum_of_digits.rb | 9 + | |
| .../sum_of_digits/sum_of_digits.swift | 19 + | |
| .../tower_of_hanoi/README.md | 72 + | |
| .../tower_of_hanoi/tower_of_hanoi_BinarySolution.c | 13 + | |
| .../karger_minimum_cut_algorithm/README.md | 14 +- | |
| .../karger_minimum_cut_algorithm.cpp | 193 +++ | |
| .../Random_number_selection_from_a_stream.cpp | 42 + | |
| .../reservoir_sampling/reservoir_sampling.cpp | 57 + | |
| .../shuffle_an_array/shuffle_an_array.py | 14 + | |
| code/search/binary_search/binary_search.c | 25 +- | |
| code/search/binary_search/binary_search.cpp | 209 ++- | |
| code/search/binary_search/binary_search.hs | 24 + | |
| code/search/binary_search/binary_search.java | 25 +- | |
| code/search/binary_search/binary_search.rb | 27 + | |
| .../exponential_search/exponential_search.go | 2 +- | |
| .../interpolation_search/interpolation_search.go | 88 +- | |
| code/search/jump_search/jump_search.rs | 34 + | |
| code/search/jump_search/jumpsearch.c | 66 + | |
| code/search/linear_search/linear_search.kt | 22 + | |
| code/search/linear_search/linear_search.nim | 10 + | |
| code/search/linear_search/linear_search.swift | 26 + | |
| code/search/ternary_search/ternary_search.kt | 28 + | |
| code/search/ternary_search/ternary_search.rs | 35 + | |
| code/selection-algorithms/Quick_select.java | 31 + | |
| code/selection-algorithms/quickselect.go | 50 + | |
| code/selection-algorithms/quickselect.py | 39 + | |
| code/selection-algorithms/quickselect_stl.cpp | 17 + | |
| code/sorting/Sleep_Sort/Sleep_Sort.cs | 2 +- | |
| code/sorting/Sleep_Sort/Sleep_sort.php | 20 + | |
| code/sorting/Sleep_Sort/sleep_sort.cpp | 21 +- | |
| code/sorting/Sleep_Sort/sleep_sort.m | 43 + | |
| code/sorting/Sleep_Sort/sleep_sort.swift | 21 + | |
| code/sorting/Sleep_Sort/sleepsort.rb | 28 + | |
| code/sorting/Sleep_Sort/sleepsort.sh | 1 + | |
| code/sorting/bead_sort/bead_sort.cpp | 31 +- | |
| code/sorting/bead_sort/bead_sort.m | 76 ++ | |
| code/sorting/bead_sort/bead_sort.swift | 51 + | |
| code/sorting/bead_sort/beadsort.c | 47 + | |
| code/sorting/bead_sort/beadsort.js | 1 + | |
| code/sorting/bogo_sort/bogo_sort.m | 68 + | |
| code/sorting/bogo_sort/bogo_sort.swift | 39 + | |
| code/sorting/bogo_sort/bogosort.fs | 23 + | |
| code/sorting/bogo_sort/bogosort.py | 19 + | |
| code/sorting/bubble_sort/BubbleSort.cpp | 34 - | |
| code/sorting/bubble_sort/Bubble_sort.f | 36 + | |
| code/sorting/bubble_sort/bubble-sort.sh | 59 + | |
| code/sorting/bubble_sort/bubble_sort.cpp | 45 +- | |
| code/sorting/bubble_sort/bubble_sort.jl | 21 + | |
| code/sorting/bubble_sort/bubble_sort.kt | 21 + | |
| code/sorting/bubble_sort/bubble_sort.m | 59 + | |
| code/sorting/bubble_sort/bubble_sort.php | 32 +- | |
| code/sorting/bubble_sort/bubble_sort.rs | 1 + | |
| code/sorting/bubble_sort/bubble_sort.swift | 47 +- | |
| code/sorting/bubble_sort/bubblesort.cs | 27 +- | |
| code/sorting/bubble_sort/bubblesort.hs | 3 +- | |
| code/sorting/bucket_sort/BucketSort.c | 7 +- | |
| code/sorting/bucket_sort/bucket_sort.go | 2 + | |
| code/sorting/bucket_sort/bucket_sort.hs | 1 + | |
| code/sorting/bucket_sort/bucket_sort.js | 1 + | |
| code/sorting/bucket_sort/bucket_sort.m | 95 ++ | |
| code/sorting/bucket_sort/bucket_sort.php | 1 + | |
| code/sorting/bucket_sort/bucket_sort.rb | 31 + | |
| code/sorting/bucket_sort/bucket_sort.swift | 67 + | |
| code/sorting/bucket_sort/bucketsort.cpp | 28 +- | |
| code/sorting/bucket_sort/bucketsort.py | 1 + | |
| code/sorting/circle_sort/circle_sort.cpp | 70 + | |
| code/sorting/circle_sort/circle_sort.py | 2 +- | |
| code/sorting/circle_sort/circle_sort.swift | 45 + | |
| code/sorting/comb_sort/combSort.js | 1 + | |
| code/sorting/counting_sort/CountingSort.cs | 2 +- | |
| code/sorting/counting_sort/countingSort.cpp | 20 +- | |
| code/sorting/counting_sort/countsort.c | 3 +- | |
| code/sorting/counting_sort/countsort.js | 1 + | |
| code/sorting/cycle_sort/cycle_sort.cpp | 30 +- | |
| code/sorting/cycle_sort/cycle_sort.cs | 84 ++ | |
| code/sorting/cycle_sort/cycle_sort.go | 1 + | |
| code/sorting/cycle_sort/cycle_sort.py | 2 +- | |
| code/sorting/gnome_sort/Gnome.py | 24 + | |
| code/sorting/gnome_sort/GnomeSort.java | 38 + | |
| code/sorting/gnome_sort/gnome_sort.cpp | 44 + | |
| code/sorting/heap_sort/heapSort.js | 46 - | |
| code/sorting/heap_sort/heap_sort.js | 73 +- | |
| code/sorting/heap_sort/heap_sort.m | 80 ++ | |
| code/sorting/heap_sort/heap_sort.swift | 46 + | |
| code/sorting/heap_sort/heapsort.c | 102 ++ | |
| code/sorting/insertion_sort/InsertionSort.c | 1 + | |
| code/sorting/insertion_sort/InsertionSort.cpp | 20 +- | |
| code/sorting/insertion_sort/InsertionSort.java | 1 + | |
| code/sorting/insertion_sort/insertion-sort.sh | 54 + | |
| code/sorting/insertion_sort/insertion.rs | 1 + | |
| code/sorting/insertion_sort/insertion_sort.go | 26 +- | |
| code/sorting/insertion_sort/insertion_sort.hs | 20 + | |
| code/sorting/insertion_sort/insertion_sort.js | 1 + | |
| code/sorting/insertion_sort/insertion_sort.m | 49 + | |
| code/sorting/insertion_sort/insertion_sort.php | 2 +- | |
| code/sorting/insertion_sort/insertion_sort.rb | 24 + | |
| code/sorting/insertion_sort/insertion_sort.swift | 20 + | |
| code/sorting/intro_sort/introsort.cpp | 120 ++ | |
| code/sorting/median_sort/median_sort.cpp | 1 + | |
| code/sorting/median_sort/median_sort.py | 2 +- | |
| code/sorting/median_sort/median_sort_fast.cpp | 2 +- | |
| code/sorting/merge_sort/MergeSort.cpp | 15 +- | |
| code/sorting/merge_sort/merge_sort.fs | 23 + | |
| code/sorting/merge_sort/merge_sort.hs | 22 + | |
| code/sorting/merge_sort/merge_sort.js | 2 +- | |
| code/sorting/merge_sort/merge_sort.m | 76 ++ | |
| code/sorting/merge_sort/merge_sort.swift | 47 + | |
| code/sorting/merge_sort/merge_sort.ts | 1 + | |
| code/sorting/pigeonhole_sort/pigeonhole_sort.c | 2 +- | |
| code/sorting/pigeonhole_sort/pigeonhole_sort.cpp | 26 +- | |
| code/sorting/pigeonhole_sort/pigeonhole_sort.py | 1 + | |
| code/sorting/quick_sort/QuickSort.go | 2 +- | |
| code/sorting/quick_sort/Quicksort.java | 1 + | |
| code/sorting/quick_sort/quickSort.ts | 1 + | |
| code/sorting/quick_sort/quick_sort.m | 69 + | |
| code/sorting/quick_sort/quick_sort.py | 1 + | |
| code/sorting/quick_sort/quick_sort.swift | 42 + | |
| .../quick_sort/{quick_sort.cpp => quicksort.cpp} | 33 +- | |
| code/sorting/quick_sort/quicksort.hs | 3 +- | |
| code/sorting/quick_sort/quicksort.sh | 72 + | |
| code/sorting/radix_sort/RadixSort.java | 77 ++ | |
| code/sorting/radix_sort/radix_sort.c | 58 + | |
| code/sorting/selection_sort/SelectionSort.go | 30 +- | |
| code/sorting/selection_sort/SelectionSort.java | 83 +- | |
| code/sorting/selection_sort/SelectionSort.kt | 24 + | |
| code/sorting/selection_sort/selection-sort.sh | 58 + | |
| code/sorting/selection_sort/selectionSort.js | 1 + | |
| code/sorting/selection_sort/selection_sort.cpp | 7 +- | |
| code/sorting/selection_sort/selection_sort.m | 56 + | |
| code/sorting/selection_sort/selection_sort.rs | 24 + | |
| code/sorting/selection_sort/selection_sort.swift | 26 + | |
| code/sorting/shaker_sort/README.md | 44 + | |
| code/sorting/shaker_sort/ShakerSort.java | 68 + | |
| code/sorting/shaker_sort/shaker_sort.c | 54 + | |
| code/sorting/shaker_sort/shaker_sort.cs | 65 + | |
| code/sorting/shaker_sort/shaker_sort.js | 43 + | |
| code/sorting/shaker_sort/shaker_sort.m | 65 + | |
| code/sorting/shaker_sort/shaker_sort.php | 55 + | |
| code/sorting/shaker_sort/shaker_sort.py | 38 + | |
| code/sorting/shaker_sort/shaker_sort.swift | 52 + | |
| code/sorting/shell_sort/ShellSort.cpp | 69 +- | |
| code/sorting/shell_sort/ShellSort.java | 60 + | |
| code/sorting/shell_sort/shellSort.js | 1 + | |
| code/sorting/shell_sort/shell_sort.c | 46 + | |
| code/sorting/shell_sort/shell_sort.m | 51 + | |
| code/sorting/shell_sort/shell_sort.swift | 24 + | |
| code/sorting/stooge_sort/Stooge_Sort.java | 49 + | |
| code/sorting/stooge_sort/stoogesort.py | 2 +- | |
| code/sorting/topological_sort/TopologicalSort.java | 93 ++ | |
| code/sorting/topological_sort/topological_sort.cpp | 97 ++ | |
| code/sorting/tree_sort/tree_sort.cpp | 14 +- | |
| code/sorting/tree_sort/tree_sort.go | 103 ++ | |
| code/sorting/tree_sort/treesort.c | 2 +- | |
| code/sorting/tree_sort/treesort.js | 1 + | |
| .../aho_corasick_algorithm/aho_corasick.cpp | 110 ++ | |
| .../anagram_search/anagram_search.js | 63 + | |
| .../anagram_search/anagram_search.swift | 34 + | |
| .../levenshtein_distance/LevenshteinDistance.java | 49 + | |
| .../lipogram_checker/lipogram_checker.js | 21 + | |
| .../lipogram_checker/lipogram_checker.py | 24 + | |
| .../palindrome_checker/Palindrome.java | 15 + | |
| .../palindrome_checker/Palindrome.kt | 18 + | |
| .../palindrome_checker/palindrome.c | 38 + | |
| .../palindrome_checker/palindrome.clj | 20 + | |
| .../palindrome_checker/palindrome.cpp | 45 + | |
| .../palindrome_checker/palindrome.erl | 5 + | |
| .../palindrome_checker/palindrome.ex | 7 + | |
| .../palindrome_checker/palindrome.go | 41 + | |
| .../palindrome_checker/palindrome.js | 20 + | |
| .../palindrome_checker/palindrome.php | 14 + | |
| .../palindrome_checker/palindrome.py | 34 + | |
| .../palindrome_checker/palindrome.rb | 7 + | |
| .../palindrome_checker/palindrome.rs | 11 + | |
| .../palindrome_checker/palindrome.swift | 19 + | |
| .../pangram_checker/pangram-checker.js | 13 + | |
| code/string-algorithms/pangram_checker/pangram.cpp | 69 + | |
| code/string-algorithms/pangram_checker/pangram.rb | 3 + | |
| .../pangram_checker/pangram_checker.c | 38 + | |
| .../pangram_checker/pangram_checker.go | 37 + | |
| code/unclassified/2sum/2sum.java | 23 + | |
| code/unclassified/2sum/2sum.rs | 23 + | |
| code/unclassified/average/average.cpp | 28 +- | |
| code/unclassified/average/average.go | 31 + | |
| code/unclassified/average/average.java | 2 +- | |
| code/unclassified/average/average.js | 13 + | |
| code/unclassified/average/average.php | 14 + | |
| code/unclassified/average/average.rb | 3 + | |
| code/unclassified/biggest_suffix/biggest_suffix.c | 49 + | |
| code/unclassified/conways_game_of_life/Conway.java | 172 +++ | |
| code/unclassified/conways_game_of_life/life.c | 50 + | |
| code/unclassified/conways_game_of_life/life.cpp | 152 +++ | |
| code/unclassified/conways_game_of_life/life.go | 100 ++ | |
| code/unclassified/conways_game_of_life/life.py | 54 + | |
| code/unclassified/fifteen_puzzle/Makefile | 5 + | |
| code/unclassified/fifteen_puzzle/fifteen.c | 292 +++++ | |
| code/unclassified/fifteen_puzzle/log.txt | 15 + | |
| code/unclassified/fifteen_puzzle/readme.md | 17 + | |
| code/unclassified/langtons_ant/LangtonAnt.java | 122 ++ | |
| .../{magic_sqaure => magic_square}/magic_square.c | 0 | |
| .../majority_element/majority_element.cpp | 34 + | |
| code/unclassified/utilities/convert2mp3.sh | 32 + | |
| code/unclassified/utilities/download_link.sh | 23 + | |
| 550 files changed, 24410 insertions(+), 980 deletions(-) | |
| create mode 100644 code/artificial_intelligence/Linear_Regression/LinearRegression.java | |
| create mode 100644 code/artificial_intelligence/Logistic_Regression/Logistic_Regression.py | |
| create mode 100644 code/artificial_intelligence/SAT/togasat.cpp | |
| create mode 100644 code/artificial_intelligence/decision_tree/Decision_Tree.py | |
| create mode 100644 code/artificial_intelligence/decision_tree/data_banknote_authentication.csv | |
| create mode 100644 code/artificial_intelligence/factorization_machines/README.md | |
| create mode 100644 code/artificial_intelligence/gaussian_mixture_model/README.md | |
| create mode 100644 code/artificial_intelligence/gradient_boosting_trees/README.md | |
| create mode 100644 code/artificial_intelligence/k_Nearest_Neighbours/iris.data | |
| create mode 100644 code/artificial_intelligence/k_Nearest_Neighbours/k_Nearest_Neighbours.py | |
| create mode 100644 code/artificial_intelligence/k_means/README.md | |
| create mode 100644 code/artificial_intelligence/naive_bayes/README.md | |
| create mode 100644 code/artificial_intelligence/principal_component_analysis/README.md | |
| create mode 100644 code/artificial_intelligence/random_forests/README.md | |
| create mode 100644 code/artificial_intelligence/restricted_boltzmann_machine/README.md | |
| create mode 100644 code/artificial_intelligence/support_vector_machine/README.md | |
| create mode 100644 code/artificial_intelligence/t_distributed_stochastic_neighbor_embedding/README.md | |
| create mode 100644 code/backtracking/knight_tour/knight_tour.go | |
| create mode 100644 code/backtracking/knight_tour/knight_tour.java | |
| create mode 100644 code/backtracking/knight_tour/knight_tour.py | |
| create mode 100644 code/backtracking/knight_tour/knight_tour.rs | |
| create mode 100644 code/backtracking/n_queen/NQueen.java | |
| create mode 100644 code/backtracking/n_queen/Nqueen_Backtracking.rs | |
| create mode 100644 code/backtracking/n_queen/n _queen.c | |
| create mode 100644 code/backtracking/n_queen/nqueen.go | |
| create mode 100644 code/backtracking/n_queen/nqueen.py | |
| create mode 100644 code/backtracking/n_queen/nqueen_bit.go | |
| create mode 100644 code/backtracking/number_of_ways_in_maze/no_of_ways_in_maze.go | |
| create mode 100644 code/backtracking/partitions_of_number/partitions_of_number.go | |
| create mode 100644 code/backtracking/partitions_of_set/set_partitions.go | |
| create mode 100644 code/backtracking/permutations_of_string/permutations_of_string.go | |
| create mode 100644 code/backtracking/permutations_of_string/permutations_of_string.kt | |
| create mode 100644 code/backtracking/permutations_of_string/permutations_of_string.py | |
| create mode 100644 code/backtracking/permutations_of_string/permutations_of_string_itertools.py | |
| create mode 100644 code/backtracking/permutations_of_string/permutations_of_string_stl.cpp | |
| create mode 100644 code/backtracking/powerset/PowerSet.java | |
| create mode 100644 code/backtracking/subset_sum/subset_sum.go | |
| create mode 100644 code/backtracking/sudoku_solve/SudokuSolve.c | |
| create mode 100644 code/bit-manipulation/byte_swapper/ByteSwapper.java | |
| create mode 100644 code/bit-manipulation/convert_number_binary/convert_number_binary.c | |
| create mode 100644 code/bit-manipulation/convert_number_binary/convert_number_binary.hs | |
| create mode 100644 code/bit-manipulation/convert_number_binary/convert_number_binary.php | |
| create mode 100644 code/bit-manipulation/convert_number_binary/intToBinary.py | |
| create mode 100644 code/bit-manipulation/hamming_distance/hamming_distance.c | |
| create mode 100644 code/bit-manipulation/power_of_2/PowerOf2.java | |
| create mode 100644 code/bit-manipulation/power_of_2/power_of_2.c | |
| create mode 100644 code/bit-manipulation/power_of_2/power_of_2.cpp | |
| create mode 100644 code/bit-manipulation/power_of_2/power_of_2.js | |
| create mode 100644 code/bit-manipulation/power_of_2/power_of_2.py | |
| create mode 100644 code/bit-manipulation/power_of_2/power_of_2.rs | |
| create mode 100644 code/bit-manipulation/thrice_unique_number/thrice_unique_number.js | |
| create mode 100644 code/computational_geometry/2d_line_intersection/README.md | |
| create mode 100644 code/computational_geometry/2d_line_intersection/line.c | |
| create mode 100644 code/computational_geometry/2d_line_intersection/line.java | |
| create mode 100644 code/computational_geometry/2d_line_intersection/line.js | |
| create mode 100644 code/computational_geometry/2d_line_intersection/line.py | |
| create mode 100644 code/computational_geometry/2d_line_intersection/line2dintersection.hs | |
| create mode 100644 code/computational_geometry/2d_separating_axis_test/sat.cpp | |
| create mode 100644 code/computational_geometry/area_of_polygon/area_of_polygon.c | |
| create mode 100644 code/computational_geometry/area_of_polygon/area_of_polygon.py | |
| create mode 100644 code/computational_geometry/area_of_triangle/area_of_triangle.go | |
| create mode 100644 code/computational_geometry/area_of_triangle/area_of_triangle.js | |
| create mode 100644 code/computational_geometry/axis_aligned_bounding_box_collision/axis_aligned_bounding_box_collision.go | |
| create mode 100644 code/computational_geometry/cohen_sutherland_lineclip/README.md | |
| create mode 100644 code/computational_geometry/cohen_sutherland_lineclip/lineclip.c | |
| create mode 100644 code/computational_geometry/distance_between_points/distance_between_points.go | |
| create mode 100644 code/computational_geometry/distance_between_points/distance_between_points.py | |
| create mode 100644 code/computational_geometry/graham_scan/graham_scan.cpp | |
| create mode 100644 code/computational_geometry/graham_scan/graham_scan.java | |
| create mode 100644 code/computational_geometry/jarvis_march/jarvis_march.cpp | |
| create mode 100644 code/computational_geometry/quickhull/quickHull.java | |
| create mode 100644 code/computational_geometry/quickhull/quickhull.cpp | |
| create mode 100644 code/computational_geometry/sutherland_hodgeman_clipping/README.md | |
| create mode 100644 code/computational_geometry/sutherland_hodgeman_clipping/sutherland.c | |
| create mode 100644 code/cryptography/affine_cipher/affine.cpp | |
| create mode 100644 code/cryptography/affine_cipher/affine.py | |
| create mode 100644 code/cryptography/autokey_cipher/autokey.py | |
| create mode 100644 code/cryptography/baconian_cipher/baconian.php | |
| create mode 100644 code/cryptography/baconian_cipher/baconian.py | |
| rename code/cryptography/{ciphers => }/caesar_cipher/CaesarCipher.cs (100%) | |
| create mode 100644 code/cryptography/caesar_cipher/caesar.c | |
| create mode 100644 code/cryptography/columnar_transposition_cipher/columnar_transposition.cpp | |
| create mode 100644 code/cryptography/morse_cipher/MorseCode.java | |
| create mode 100644 code/cryptography/polybius_cipher/polybius.py | |
| create mode 100644 code/cryptography/porta_cipher/porta.py | |
| create mode 100644 code/cryptography/rail_fence_cipher/rail_fence.cpp | |
| create mode 100644 code/cryptography/rail_fence_cipher/rail_fence.rb | |
| create mode 100644 code/cryptography/rot13_cipher/RotN.java | |
| create mode 100644 code/cryptography/rot13_cipher/rot13.js | |
| create mode 100644 code/cryptography/rot13_cipher/rot13.py | |
| create mode 100644 code/cryptography/runningkey_cipher/runningkey.py | |
| create mode 100644 code/cryptography/vigenere_cipher/vigenere_cipher.jl | |
| create mode 100644 code/cryptography/vigenere_cipher/vigenere_cipher.js | |
| create mode 100644 code/cryptography/vigenere_cipher/vigenere_cipher.php | |
| delete mode 100644 code/data_structures/Heap/MaxHeap.cpp | |
| rename code/data_structures/{AVL_tree => avl_tree}/AVL_tree.cpp (100%) | |
| rename code/data_structures/{B_Tree => b_Tree}/B_Tree.cpp (94%) | |
| delete mode 100644 code/data_structures/b_tree/README.md | |
| create mode 100644 code/data_structures/bag/Bag.java | |
| delete mode 100644 code/data_structures/binomial_heap/README.md | |
| create mode 100644 code/data_structures/binomial_heap/binomial_heap.c | |
| rename code/data_structures/{Binomial_Heap => binomial_heap}/binomial_heap.cpp (100%) | |
| rename code/data_structures/{Hash_Table => hash_table}/HashTable.java (100%) | |
| create mode 100644 code/data_structures/hash_table/HashTable.js | |
| delete mode 100644 code/data_structures/hash_table/README.md | |
| create mode 100644 code/data_structures/hash_table/hashtable.c | |
| create mode 100644 code/data_structures/hash_table/hashtable.cs | |
| create mode 100644 code/data_structures/hash_table/hashtable.go | |
| create mode 100644 code/data_structures/heap/MaxHeap.cpp | |
| rename code/data_structures/{Heap => heap}/README.md (100%) | |
| rename code/data_structures/{Heap => heap}/max_heap.c (100%) | |
| rename code/data_structures/{Heap => heap}/max_heap.go (85%) | |
| rename code/data_structures/{Heap => heap}/max_heap.py (100%) | |
| rename code/data_structures/{Heap => heap}/minHeap.swift (100%) | |
| rename code/data_structures/{Heap => heap}/min_heap.cpp (100%) | |
| rename code/data_structures/{Heap => heap}/min_heap.py (100%) | |
| rename code/data_structures/{Heap => heap}/minheap.cpp (100%) | |
| rename code/data_structures/{Heap => heap}/minheap.java (100%) | |
| create mode 100644 code/data_structures/interval_trees/Interval.java | |
| create mode 100644 code/data_structures/kd_tree/KDTree.cpp | |
| create mode 100644 code/data_structures/kd_tree/KDTree.java | |
| rename code/data_structures/{Leftist_Tree => leftist_tree}/LeftistPriorityQueue.cpp (100%) | |
| delete mode 100644 code/data_structures/leftist_tree/README.md | |
| create mode 100644 code/data_structures/linked_list/circular_linked_list/circular_linked_list.java | |
| create mode 100644 code/data_structures/linked_list/circular_linked_list/circular_linkedlist.py | |
| create mode 100644 code/data_structures/linked_list/doubly_linked_list/Doubly_linked_list.py | |
| create mode 100644 code/data_structures/linked_list/doubly_linked_list/doubly_linked_list.go | |
| create mode 100644 code/data_structures/linked_list/linked_list/linked_list.rb | |
| create mode 100644 code/data_structures/linked_list/linked_list/linked_list.swift | |
| create mode 100644 code/data_structures/linked_list/linked_list/singly_linked_list_with_classes.cpp | |
| rename code/data_structures/{Queue => queue}/README.md (100%) | |
| create mode 100644 code/data_structures/queue/queue/Queue.cs | |
| create mode 100644 code/data_structures/queue/queue/queue.js | |
| create mode 100644 code/data_structures/queue/queue/queue.swift | |
| create mode 100644 code/data_structures/queue/queue_using_stacks/QueueStacks.java | |
| create mode 100644 code/data_structures/queue/queue_using_stacks/queue_using_stacks.cpp | |
| rename code/data_structures/{Queue => queue}/reverse_queue/reverse_queue.cpp (100%) | |
| rename code/data_structures/{Queue => queue}/reverse_queue/reverse_queue.java (100%) | |
| create mode 100644 code/data_structures/queue/reverse_queue/reverse_queue.py | |
| create mode 100644 code/data_structures/queue/reverse_queue/reverse_queue.swift | |
| create mode 100644 code/data_structures/red_black_tree/red_black_tree.cpp | |
| create mode 100644 code/data_structures/segment_tree/segment_tree_kth_statistics_on_segment.cpp | |
| create mode 100644 code/data_structures/skip_list/skip_list.cpp | |
| create mode 100644 code/data_structures/splay_tree/splay_tree.kt | |
| rename code/data_structures/{Stack => stack}/README.md (100%) | |
| rename code/data_structures/{Stack => stack}/infix_to_postfix/infix_to_postfix.c (100%) | |
| rename code/data_structures/{Stack => stack}/infix_to_postfix/infix_to_postfix.cpp (100%) | |
| rename code/data_structures/{Stack => stack}/infix_to_postfix/infix_to_postfix.py (100%) | |
| rename code/data_structures/{Stack => stack}/postfix_evaluation/infix_to_postfix_evaluation.cpp (100%) | |
| create mode 100644 code/data_structures/stack/postfix_evaluation/postfix_evaluation.c | |
| create mode 100755 code/data_structures/stack/postfix_evaluation/postfix_evaluation.sh | |
| rename code/data_structures/{Stack => stack}/prefix_to_postfix/prefix_to_postfix.py (100%) | |
| create mode 100644 code/data_structures/stack/reverse_stack/reverseStack.java | |
| create mode 100644 code/data_structures/stack/reverse_stack/reverse_stack.c | |
| create mode 100644 code/data_structures/stack/reverse_stack/reverse_stack.cs | |
| create mode 100644 code/data_structures/stack/reverse_stack/reverse_stack.py | |
| create mode 100644 code/data_structures/stack/reverse_stack/reverse_stack.swift | |
| rename code/data_structures/{Stack => stack}/reverse_stack/reverse_stack_without_extra_space.cpp (100%) | |
| create mode 100644 code/data_structures/stack/sort_stack/sort_stack.c | |
| create mode 100644 code/data_structures/stack/sort_stack/sort_stack.cpp | |
| create mode 100644 code/data_structures/stack/stack/Stack.php | |
| create mode 100644 code/data_structures/stack/stack/stack.swift | |
| create mode 100644 code/data_structures/treap/persistent_treap.kt | |
| delete mode 100644 code/data_structures/tree/README.md | |
| rename code/data_structures/{Tree => tree}/binary_search_tree/binary_search_tree.c (100%) | |
| rename code/data_structures/{Tree => tree}/binary_search_tree/binary_search_tree.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/binary_search_tree/binary_search_tree.js (100%) | |
| rename code/data_structures/{Tree => tree}/binary_search_tree/binary_search_tree.py (100%) | |
| rename code/data_structures/{Tree => tree}/binary_search_tree/binary_search_tree.rb (100%) | |
| delete mode 100644 code/data_structures/tree/binary_search_tree_height/README.md | |
| rename code/data_structures/{Tree => tree}/binary_tree/BinaryTree.java (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree/bottom_view_binary_tree/Bottom_view.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree/bottom_view_binary_tree/Bottom_view.java (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_diameter/binary_tree_diameter.c (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_diameter/binary_tree_diameter.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_diameter/diameter_binary_tree.java (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_diameter/diameter_binary_tree.py (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_diameter/diameter_tree.c (100%) | |
| rename code/data_structures/{Tree/binary_search_tree_height => tree/binary_tree_maximum_height}/BinaryTreeHeight.java (100%) | |
| rename code/data_structures/{avl_tree => tree/binary_tree_maximum_height}/README.md (100%) | |
| rename code/data_structures/{Tree/binary_search_tree_height/binary_search_tree_height.py => tree/binary_tree_maximum_height/binary_tree_height.py} (100%) | |
| rename code/data_structures/{Tree/binary_search_tree_height/Binary_Search_ Tree_Height_Max_Depth.cpp => tree/binary_tree_maximum_height/binary_tree_height_1.cpp} (100%) | |
| rename code/data_structures/{Tree/binary_search_tree_height/binary_search_tree_height.cpp => tree/binary_tree_maximum_height/binary_tree_height_2.cpp} (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_minimum_height/min_depth.c (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_minimum_height/min_height.py (100%) | |
| create mode 100644 code/data_structures/tree/binary_tree_minimum_height/min_height_binary_tree.java | |
| rename code/data_structures/{Tree => tree}/binary_tree_minimum_height/minimum_height_binary_tree.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_mirror/Binary_Tree_Mirror.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_mirror/MirrorElementsBst.py (100%) | |
| rename code/data_structures/{Tree => tree}/binary_tree_mirror/mirror_image.c (100%) | |
| rename code/data_structures/{Tree => tree}/check_balanced_binary_tree/balanced_or_not.java (100%) | |
| rename code/data_structures/{Tree => tree}/inorder_and_preorder_to_postorder/inorder_and_preorder_to_postorder.c (100%) | |
| rename code/data_structures/{Tree => tree}/inorder_and_preorder_to_postorder/inorder_and_preorder_to_postorder.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/left_view_binary_tree/leftView.java (100%) | |
| rename code/data_structures/{Tree => tree}/make_tree_from_inorder_and_preorder/MakeTreefromInorderAndPreorder.java (100%) | |
| create mode 100644 code/data_structures/tree/right_threaded_binary_tree/right_threaded_binary_tree.cpp | |
| rename code/data_structures/{Tree => tree}/right_view_binary_tree/right_view.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/right_view_binary_tree/right_view.py (100%) | |
| rename code/data_structures/{Tree => tree}/right_view_binary_tree/right_view_binary_tree.cpp (100%) | |
| rename code/data_structures/{Tree => tree}/sum_left_leaves/sum_left_leaves.c (100%) | |
| rename code/data_structures/{Trie => trie}/Trie.c (100%) | |
| create mode 100644 code/data_structures/trie/Trie.cs | |
| rename code/data_structures/{Trie => trie}/Trie.java (66%) | |
| rename code/data_structures/{Trie => trie}/Trie.py (79%) | |
| rename code/data_structures/{Trie => trie}/Trie_add_and_search.cpp (100%) | |
| create mode 100644 code/data_structures/trie/trie.rb | |
| create mode 100644 code/data_structures/union_find/union_find.c | |
| create mode 100644 code/divide_conquer/inversion_count/inversion_count.js | |
| create mode 100644 code/divide_conquer/inversion_count/inversion_count.py | |
| create mode 100644 code/divide_conquer/merge_sort_using_divide_and_conquer/MergeSort.java | |
| create mode 100644 code/divide_conquer/quick_sort/QuickSort.java | |
| create mode 100644 code/divide_conquer/quick_sort/quick_sort.rs | |
| create mode 100644 code/dynamic_programming/Array_Median/median.php | |
| create mode 100644 code/dynamic_programming/Array_Median/median.rb | |
| create mode 100644 code/dynamic_programming/coin_change/coin_change.py | |
| create mode 100644 code/dynamic_programming/coin_change/coinchange.c | |
| create mode 100644 code/dynamic_programming/coin_change/coinchange.go | |
| create mode 100644 code/dynamic_programming/egg_dropping_puzzle/eggDropping.hs | |
| create mode 100644 code/dynamic_programming/knapsack/Knapsack.java | |
| create mode 100644 code/dynamic_programming/knapsack/knapsack.js | |
| create mode 100644 code/dynamic_programming/knapsack/knapsack.py | |
| create mode 100644 code/dynamic_programming/longest_bitonic_sequence/longest_bitonic_sequence.c | |
| create mode 100644 code/dynamic_programming/longest_common_subsequence/longestCommonSubsequence.go | |
| create mode 100644 code/dynamic_programming/longest_palindromic_sequence/longest_palindromic_sequence.c | |
| create mode 100644 code/dynamic_programming/longest_palindromic_sequence/longest_palindromic_sequence.cpp | |
| create mode 100644 code/dynamic_programming/longest_palindromic_sequence/longest_palindromic_sequence.js | |
| create mode 100644 code/dynamic_programming/longest_palindromic_sequence/longest_palindromic_sequence.py | |
| create mode 100644 code/dynamic_programming/longest_palindromic_substring/LongestPalindromicSubstring.cpp | |
| create mode 100644 code/dynamic_programming/matrix_chain_multiplication/MatrixChainMultiplication.java | |
| create mode 100644 code/dynamic_programming/rod_cutting/rod_cutting.hs | |
| create mode 100644 code/dynamic_programming/subset_sum/subset_sum.go | |
| delete mode 100644 code/graph-algorithms/bellman_ford_algorithm/BellmanFord.java | |
| create mode 100644 code/graph-algorithms/bellman_ford_algorithm/BellmanFordAdjacencyList.java | |
| create mode 100644 code/graph-algorithms/bellman_ford_algorithm/BellmanFordEdgeList.java | |
| create mode 100644 code/graph-algorithms/bellman_ford_algorithm/bellman_ford.c | |
| create mode 100644 code/graph-algorithms/boruvka_minimum_spanning_tree/boruvka_minimum_spanning_tree.cpp | |
| create mode 100644 code/graph-algorithms/depth_first_search/Dfs.kt | |
| create mode 100644 code/graph-algorithms/topological_sort/TopologicalSortAdjacencyList.java | |
| create mode 100644 code/graph-algorithms/topological_sort/TopologicalSortAdjacencyMatrix.java | |
| create mode 100644 code/greedy-algorithms/activity_selection/activity_selection.py | |
| create mode 100644 code/greedy-algorithms/fractional_knapsack/fractional_knapsack.go | |
| create mode 100644 code/greedy-algorithms/kruskal_minimum_spanning_tree/kruskal.c | |
| rename code/mathematical-algorithms/Check_is_square/{FindindSquare.java => FindingSquare.java} (84%) | |
| create mode 100644 code/mathematical-algorithms/EulerTotient/EulerTotient.java | |
| create mode 100644 code/mathematical-algorithms/armstrong_numbers/armstrong_numbers.java | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/AutomorphicNumber.java | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/README.md | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/automorphic.cs | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/automorphic.go | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/automorphic.js | |
| create mode 100644 code/mathematical-algorithms/automorphic_numbers/automorphic.php | |
| create mode 100644 code/mathematical-algorithms/average_stream_numbers/average_stream_numbers.cpp | |
| create mode 100644 code/mathematical-algorithms/average_stream_numbers/average_stream_numbers.py | |
| create mode 100644 code/mathematical-algorithms/basic/Greatest_digit_in_number/Greatest_digit_in_number.java | |
| create mode 100644 code/mathematical-algorithms/basic/Greatest_digit_in_number/greatest_digit_in_number.php | |
| create mode 100644 code/mathematical-algorithms/basic/Greatest_digit_in_number/greatest_digit_in_number.rb | |
| create mode 100644 code/mathematical-algorithms/basic/Smallest_digit_in_number/smallest_digit_in_number.java | |
| create mode 100644 code/mathematical-algorithms/basic/Smallest_digit_in_number/smallest_digit_in_number.php | |
| create mode 100644 code/mathematical-algorithms/basic/Smallest_digit_in_number/smallest_digit_in_number.rb | |
| create mode 100644 code/mathematical-algorithms/basic/log_of_factorial/logfactorial.cpp | |
| create mode 100644 code/mathematical-algorithms/binomial_coefficient/binomialCoefficient.cpp | |
| create mode 100644 code/mathematical-algorithms/binomial_coefficient/binomial_coefficient_modular.cpp | |
| create mode 100644 code/mathematical-algorithms/count_digits/Count_digits.java | |
| create mode 100644 code/mathematical-algorithms/count_digits/count_digits.js | |
| create mode 100644 code/mathematical-algorithms/count_digits/count_digits.py | |
| create mode 100644 code/mathematical-algorithms/count_digits/count_digits.swift | |
| create mode 100644 code/mathematical-algorithms/count_trailing_zeroes/count_trailing_zeros_factorial.js | |
| create mode 100644 code/mathematical-algorithms/diophantine/diophantine.cpp | |
| create mode 100644 code/mathematical-algorithms/exponentiation_power/exponentation_power_gnu_easy.cpp | |
| create mode 100644 code/mathematical-algorithms/exponentiation_power/modulo_exponentation_power.cpp | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.clj | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.erl | |
| create mode 100755 code/mathematical-algorithms/factorial/factorial.ex | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.go | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.js | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.php | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.rb | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.rs | |
| create mode 100644 code/mathematical-algorithms/factorial/factorial.swift | |
| create mode 100755 code/mathematical-algorithms/fast_fourier_transform/FFT.java | |
| create mode 100644 code/mathematical-algorithms/fast_inverse_sqrt/fast_inverse_sqrt.cpp | |
| create mode 100644 code/mathematical-algorithms/fibonacci_number/fibonacci.clj | |
| create mode 100644 code/mathematical-algorithms/fibonacci_number/fibonacci.java | |
| create mode 100644 code/mathematical-algorithms/fibonacci_number/fibonacci.swift | |
| create mode 100644 code/mathematical-algorithms/fibonacci_number/fibonacci_memorized.swift | |
| create mode 100644 code/mathematical-algorithms/gcd_and_lcm/gcd_and_lcm.c | |
| create mode 100644 code/mathematical-algorithms/gcd_and_lcm/gcd_and_lcm.go | |
| create mode 100644 code/mathematical-algorithms/gcd_and_lcm/gcd_and_lcm.php | |
| create mode 100644 code/mathematical-algorithms/gcd_and_lcm/gcd_gnu.cpp | |
| create mode 100644 code/mathematical-algorithms/integer_conversion/decimal_to_any_base.js | |
| create mode 100644 code/mathematical-algorithms/integer_conversion/decimal_to_int.go | |
| create mode 100644 code/mathematical-algorithms/lexicographic_string_rank/lexicographic_string_rank.c | |
| create mode 100644 code/mathematical-algorithms/lexicographic_string_rank/lexicographic_string_rank.cpp | |
| create mode 100644 code/mathematical-algorithms/lexicographic_string_rank/lexicographic_string_rank.py | |
| create mode 100644 code/mathematical-algorithms/lucky_number/lucky_number.java | |
| create mode 100644 code/mathematical-algorithms/modular_inverse/modular_inverse.java | |
| create mode 100644 code/mathematical-algorithms/modular_inverse/modular_inverse.rb | |
| create mode 100644 code/mathematical-algorithms/multiply_polynomial/FFT.cpp | |
| create mode 100644 code/mathematical-algorithms/next_larger_number/next_larger_number.php | |
| create mode 100644 code/mathematical-algorithms/pandigital_number/README.md | |
| create mode 100644 code/mathematical-algorithms/pandigital_number/pandigital_number.c | |
| create mode 100644 code/mathematical-algorithms/permutation_lexicographic_order/permutation_lexicographic_order.cpp | |
| create mode 100644 code/mathematical-algorithms/prime_factors/prime_factors.py | |
| create mode 100644 code/mathematical-algorithms/prime_numbers_of_n/prime_factors.py | |
| create mode 100644 code/mathematical-algorithms/reverse_factorial/reverse_factorial.java | |
| create mode 100644 code/mathematical-algorithms/reverse_factorial/reverse_factorial.js | |
| create mode 100644 code/mathematical-algorithms/reverse_factorial/reverse_factorial.py | |
| create mode 100644 code/mathematical-algorithms/reverse_number/Reverse.java | |
| create mode 100644 code/mathematical-algorithms/reverse_number/reverse_number.py | |
| create mode 100644 code/mathematical-algorithms/reverse_number/reversed_number.swift | |
| create mode 100644 code/mathematical-algorithms/russian_peasant_multiplication/russian_peasant.rs | |
| create mode 100644 code/mathematical-algorithms/shuffle_array/arrayshuffle.rb | |
| create mode 100644 code/mathematical-algorithms/shuffle_array/shuffle_array.cpp | |
| create mode 100644 code/mathematical-algorithms/shuffle_array/shuffle_array.js | |
| create mode 100644 code/mathematical-algorithms/std/std.c | |
| create mode 100644 code/mathematical-algorithms/std/std.go | |
| create mode 100644 code/mathematical-algorithms/sum_of_digits/sum_of_digits.rb | |
| create mode 100644 code/mathematical-algorithms/sum_of_digits/sum_of_digits.swift | |
| create mode 100644 code/mathematical-algorithms/tower_of_hanoi/tower_of_hanoi_BinarySolution.c | |
| create mode 100644 code/randomized-algorithms/karger_minimum_cut_algorithm/karger_minimum_cut_algorithm.cpp | |
| create mode 100644 code/randomized-algorithms/random_from_stream/Random_number_selection_from_a_stream.cpp | |
| create mode 100644 code/randomized-algorithms/reservoir_sampling/reservoir_sampling.cpp | |
| create mode 100644 code/randomized-algorithms/shuffle_an_array/shuffle_an_array.py | |
| create mode 100644 code/search/binary_search/binary_search.hs | |
| create mode 100644 code/search/binary_search/binary_search.rb | |
| create mode 100644 code/search/jump_search/jump_search.rs | |
| create mode 100644 code/search/jump_search/jumpsearch.c | |
| create mode 100644 code/search/linear_search/linear_search.kt | |
| create mode 100644 code/search/linear_search/linear_search.nim | |
| create mode 100644 code/search/linear_search/linear_search.swift | |
| create mode 100644 code/search/ternary_search/ternary_search.kt | |
| create mode 100644 code/search/ternary_search/ternary_search.rs | |
| create mode 100644 code/selection-algorithms/Quick_select.java | |
| create mode 100644 code/selection-algorithms/quickselect.go | |
| create mode 100644 code/selection-algorithms/quickselect.py | |
| create mode 100644 code/selection-algorithms/quickselect_stl.cpp | |
| create mode 100644 code/sorting/Sleep_Sort/Sleep_sort.php | |
| create mode 100644 code/sorting/Sleep_Sort/sleep_sort.m | |
| create mode 100644 code/sorting/Sleep_Sort/sleep_sort.swift | |
| create mode 100644 code/sorting/Sleep_Sort/sleepsort.rb | |
| create mode 100644 code/sorting/bead_sort/bead_sort.m | |
| create mode 100644 code/sorting/bead_sort/bead_sort.swift | |
| create mode 100644 code/sorting/bead_sort/beadsort.c | |
| create mode 100644 code/sorting/bogo_sort/bogo_sort.m | |
| create mode 100644 code/sorting/bogo_sort/bogo_sort.swift | |
| create mode 100644 code/sorting/bogo_sort/bogosort.fs | |
| create mode 100644 code/sorting/bogo_sort/bogosort.py | |
| delete mode 100644 code/sorting/bubble_sort/BubbleSort.cpp | |
| create mode 100644 code/sorting/bubble_sort/Bubble_sort.f | |
| create mode 100755 code/sorting/bubble_sort/bubble-sort.sh | |
| create mode 100644 code/sorting/bubble_sort/bubble_sort.jl | |
| create mode 100644 code/sorting/bubble_sort/bubble_sort.kt | |
| create mode 100644 code/sorting/bubble_sort/bubble_sort.m | |
| mode change 100755 => 100644 code/sorting/bubble_sort/bubble_sort.swift | |
| create mode 100644 code/sorting/bucket_sort/bucket_sort.m | |
| create mode 100644 code/sorting/bucket_sort/bucket_sort.rb | |
| create mode 100644 code/sorting/bucket_sort/bucket_sort.swift | |
| create mode 100644 code/sorting/circle_sort/circle_sort.cpp | |
| create mode 100644 code/sorting/circle_sort/circle_sort.swift | |
| create mode 100644 code/sorting/cycle_sort/cycle_sort.cs | |
| create mode 100644 code/sorting/gnome_sort/Gnome.py | |
| create mode 100644 code/sorting/gnome_sort/GnomeSort.java | |
| create mode 100644 code/sorting/gnome_sort/gnome_sort.cpp | |
| delete mode 100644 code/sorting/heap_sort/heapSort.js | |
| create mode 100644 code/sorting/heap_sort/heap_sort.m | |
| create mode 100644 code/sorting/heap_sort/heap_sort.swift | |
| create mode 100644 code/sorting/heap_sort/heapsort.c | |
| create mode 100755 code/sorting/insertion_sort/insertion-sort.sh | |
| create mode 100644 code/sorting/insertion_sort/insertion_sort.hs | |
| create mode 100644 code/sorting/insertion_sort/insertion_sort.m | |
| create mode 100644 code/sorting/insertion_sort/insertion_sort.rb | |
| create mode 100644 code/sorting/insertion_sort/insertion_sort.swift | |
| create mode 100644 code/sorting/intro_sort/introsort.cpp | |
| create mode 100644 code/sorting/merge_sort/merge_sort.fs | |
| create mode 100644 code/sorting/merge_sort/merge_sort.hs | |
| create mode 100644 code/sorting/merge_sort/merge_sort.m | |
| create mode 100644 code/sorting/merge_sort/merge_sort.swift | |
| create mode 100644 code/sorting/quick_sort/quick_sort.m | |
| create mode 100644 code/sorting/quick_sort/quick_sort.swift | |
| rename code/sorting/quick_sort/{quick_sort.cpp => quicksort.cpp} (53%) | |
| create mode 100755 code/sorting/quick_s |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment