diff --git a/en/Basic Math/Average_Mean.md b/en/Basic Math/Average_Mean.md index be5f191b..f31972d5 100644 --- a/en/Basic Math/Average_Mean.md +++ b/en/Basic Math/Average_Mean.md @@ -57,11 +57,6 @@ If we properly consider significant digits: `sum / count = 23` Return the value of 22.857142 or `23`. -## Implementation - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mean.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/average_mean.rb) - ## Video URL - [Mean on Khan Academy](https://www.khanacademy.org/math/ap-statistics/summarizing-quantitative-data-ap/measuring-center-quantitative/v/mean-median-and-mode) diff --git a/en/Basic Math/Fibonacci_Numbers.md b/en/Basic Math/Fibonacci_Numbers.md index bb61a3e0..eb8fac3f 100644 --- a/en/Basic Math/Fibonacci_Numbers.md +++ b/en/Basic Math/Fibonacci_Numbers.md @@ -55,21 +55,6 @@ Calculate matrix^8 ### Step 5 F(8)=21 -## Implementation - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/dynamic_programming/fibonacci.ex) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Fibonacci.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/dynamic/fibonacci.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Maths/Fibonacci.hs) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Maths/Fibonacci.js) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Maths/Fibonacci.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/fibonacci.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/fibonacci.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Mathematics/Fibonacci.scala) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/recursion/fibonacci.swift) - ## Video URL - [Youtube](https://www.youtube.com/watch?v=EEb6JP3NXBI) diff --git a/en/Basic Math/Find the maximum number.md b/en/Basic Math/Find the maximum number.md index 1e7cf5f0..6579ad98 100644 --- a/en/Basic Math/Find the maximum number.md +++ b/en/Basic Math/Find the maximum number.md @@ -98,10 +98,6 @@ Get the last value out of the list by using predefined last method. Return the value 70. -## Implementation - -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/find_max.rb) - # Source - [GeeksForGeeks](https://www.geeksforgeeks.org/c-program-find-largest-element-array/) diff --git a/en/Ciphers/caesar_cipher.md b/en/Ciphers/caesar_cipher.md index 9b1ba40f..592b0374 100644 --- a/en/Ciphers/caesar_cipher.md +++ b/en/Ciphers/caesar_cipher.md @@ -35,11 +35,3 @@ Let us say we are sending a secret message to a friend. * The second letter is `h`. The letter 6 letters away is `n`. Our message is now `Zn` * We continue like that until the end. Our final message is: `Znk Igkygx iovnkx oy g lat yahyzozazout iovnkx.` * Decryption is the same way, except instead of going to the right in the alphabet, we go backwards. - -## Implementation - -* [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/caesar_cipher.cpp) -* [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Ciphers/CaesarCipher.js) -* [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Ciphers/CaesarCipher.php) -* [Python](https://github.com/TheAlgorithms/Python/blob/master/ciphers/caesar_cipher.py) - diff --git a/en/Ciphers/hill_cipher.md b/en/Ciphers/hill_cipher.md index 5c473e47..775e0ecb 100644 --- a/en/Ciphers/hill_cipher.md +++ b/en/Ciphers/hill_cipher.md @@ -54,10 +54,6 @@ So we will get the encrypted text as **POH**. [21 12 8] [7] [539] [19] ``` -## Implementations - -[**Python**](https://github.com/TheAlgorithms/Python/blob/master/ciphers/hill_cipher.py) - ## Video Explanation [Video explanation of the Hill Cipher](https://www.youtube.com/watch?v=6T46sgty4Mk) diff --git a/en/Ciphers/playfair-cipher.md b/en/Ciphers/playfair-cipher.md index 7e1c3bc1..158a4a92 100644 --- a/en/Ciphers/playfair-cipher.md +++ b/en/Ciphers/playfair-cipher.md @@ -117,10 +117,6 @@ So we will get the encrypted text as **gatlmzclrqxa**. ``` So we will get the encrypted text as **instrumentsx**. -## Implementations - -- [**Python**](https://github.com/TheAlgorithms/Python/blob/master/ciphers/playfair_cipher.py) - ## Video Explanation - [**Video explanation of the Playfair Cipher algorithm**](https://www.youtube.com/watch?v=UURjVI5cw4g) diff --git a/en/Ciphers/rsa_cipher.md b/en/Ciphers/rsa_cipher.md index 97649cec..3cae166d 100644 --- a/en/Ciphers/rsa_cipher.md +++ b/en/Ciphers/rsa_cipher.md @@ -153,10 +153,3 @@ Enter your Private Key: 23 PlainText: 51 ``` - -## Implementations - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_cipher.py) -- [GoLang](https://github.com/TheAlgorithms/Go/blob/master/cipher/rsa/rsa.go) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/ciphers/RSA.java) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/ciphers/rsa.rb) \ No newline at end of file diff --git a/en/Ciphers/vigenere_cipher.md b/en/Ciphers/vigenere_cipher.md index 88768aaa..94bf5749 100644 --- a/en/Ciphers/vigenere_cipher.md +++ b/en/Ciphers/vigenere_cipher.md @@ -61,13 +61,3 @@ Decryption is similar to encryption (except for the subtraction operation). - [Index of coincidence](https://en.wikipedia.org/wiki/Index_of_coincidence) 3. Once the key length is found, [frequency analysis](https://en.wikipedia.org/wiki/Frequency_analysis) can be used to find the key and hence crack the cipher. 4. Therefore, this cipher should not be used to encrypt any important data. - -## Implementations - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/vigenere_cipher.cpp) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Encoders/VigenereEncoder.cs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/ciphers/Vigenere.java) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Ciphers/VigenereCipher.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/cipher/vigenere.jl) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/ciphers/vigenere_cipher.py) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/ciphers/vigenere.rs) diff --git a/en/Data Structures/Graph/Bellman-Ford.md b/en/Data Structures/Graph/Bellman-Ford.md index ee30886e..49b1e59c 100644 --- a/en/Data Structures/Graph/Bellman-Ford.md +++ b/en/Data Structures/Graph/Bellman-Ford.md @@ -88,13 +88,6 @@ O(V^2) E 1 A->B->E = -1 + 2 ``` -#### Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/bellman_ford.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bellman_ford.c) - #### Video Explanation [A video explaining the Bellman-Ford Algorithm](https://www.youtube.com/watch?v=hxMWBBCpR6A) diff --git a/en/Data Structures/Linked Lists/Circular Linked List.md b/en/Data Structures/Linked Lists/Circular Linked List.md index 4c031bd7..bf5d5081 100644 --- a/en/Data Structures/Linked Lists/Circular Linked List.md +++ b/en/Data Structures/Linked Lists/Circular Linked List.md @@ -64,12 +64,6 @@ public void insertHead(int data) } ``` -## Code Implementation Links - -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Data-Structures/Linked-List/SinglyCircularLinkedList.js) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/cll/cll.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/circular_linked_list.py) - ## Video Explanation [Video explanation on YouTube](https://youtu.be/HMkdlu5sP4A) diff --git a/en/Data Structures/Linked Lists/Doubly Linked List.md b/en/Data Structures/Linked Lists/Doubly Linked List.md index e4cbb791..65fb7692 100644 --- a/en/Data Structures/Linked Lists/Doubly Linked List.md +++ b/en/Data Structures/Linked Lists/Doubly Linked List.md @@ -100,14 +100,6 @@ class LinkedList { ![Tracing of algorithm](https://www.geeksforgeeks.org/wp-content/uploads/gq/2014/03/DLL_add_middle1.png) -## Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/doubly_linked_list.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/double_list.rb) - ## Video Explanation [A CS50 video explaining the Doubly Linked List Data Structure](https://www.youtube.com/watch?v=FHMPswJDCvU) diff --git a/en/Data Structures/Linked Lists/Singly Linked List.md b/en/Data Structures/Linked Lists/Singly Linked List.md index 729eba0a..4b7e5823 100644 --- a/en/Data Structures/Linked Lists/Singly Linked List.md +++ b/en/Data Structures/Linked Lists/Singly Linked List.md @@ -37,12 +37,6 @@ class LinkedList { } ``` -## Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/linked_list.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py) - ## Video Explanation [A CS50 video explaining the Linked List Data Structure](https://www.youtube.com/watch?v=5nsKtQuT6E8) diff --git a/en/Data Structures/Probablistic/BloomFilter.md b/en/Data Structures/Probablistic/BloomFilter.md index b1752d9b..3fc5a19a 100644 --- a/en/Data Structures/Probablistic/BloomFilter.md +++ b/en/Data Structures/Probablistic/BloomFilter.md @@ -117,12 +117,6 @@ Notice that this does not match either the result of `foo` or `bar`, however bec The probability of false positives increases with the probability of hash collisions within the filter. However, you can optimize the number of collisions if you have some sense of the cardinality of your set ahead of time. You can do this by optimizing `k` and `M`, `M` should be ~ 8-10 bits per expected item, and `k` should be `(M/n) * ln2`. -## Examples - -Implementations of the Bloom Filter are available for: - -* [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/DataStructures/Probabilistic/BloomFilter.cs) - ## Video Explainer [Video Explainer by Narendra L](https://www.youtube.com/watch?v=Bay3X9PAX5k) \ No newline at end of file diff --git a/en/Dynamic Programming/Coin Change.md b/en/Dynamic Programming/Coin Change.md index 1ea91c86..187f0dc0 100644 --- a/en/Dynamic Programming/Coin Change.md +++ b/en/Dynamic Programming/Coin Change.md @@ -48,18 +48,5 @@ Let's say we have 3 coin types `[1,2,3]` and we want to change for `7` cents. So ``` So the final answer is **8**. 8 ways to make change of 7 cents using all coin types. `{{1,1,1,1,1,1,1}, {1,1,1,1,1,2}, {1,1,1,2,2}, {1,2,2,2}, {1,1,1,1,3}, {1,3,3}, {2,2,3}, {1,1,2,3}}` -#### Code Implementation Link -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Dynamic-Programming/CoinChange.js) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/coin_change.cpp) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/dynamic/coinchange.go) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/coin_change.rs) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/dynamic_programming/coin_change.dart) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/dynamic_programming/coin_change.rb) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/DynamicProgramming/CoinChange.scala) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/dynamic_programming/coin_change.jl) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/misc/coin_change.lua) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Problems/DynamicProgramming/CoinChange/DynamicCoinChangeSolver.cs) - #### Video Explanation [Total Unique Ways To Make Change by Back To Back SWE](https://www.youtube.com/watch?v=DJ4a7cmjZY0) diff --git a/en/Dynamic Programming/Kadane's Algorithm.md b/en/Dynamic Programming/Kadane's Algorithm.md index 1b82136d..6d6c89f0 100644 --- a/en/Dynamic Programming/Kadane's Algorithm.md +++ b/en/Dynamic Programming/Kadane's Algorithm.md @@ -106,12 +106,6 @@ largest_sum = max(5, 6) = 6 ```Hence the output will be 6``` - - -### Code Implementation Links - -- [Python](https://github.com/TheAlgorithms/Python/blob/252df0a149502143a14e7283424d40b785dd451c/maths/kadanes.py) - ### Video Explanation Link - [Kadane's Algorithm to Maximum Sum Subarray Problem](https://www.youtube.com/watch?v=86CQq3pKSUw) diff --git a/en/Dynamic Programming/Longest Common Subsequence.md b/en/Dynamic Programming/Longest Common Subsequence.md index 2dc8f1ed..d613f807 100644 --- a/en/Dynamic Programming/Longest Common Subsequence.md +++ b/en/Dynamic Programming/Longest Common Subsequence.md @@ -69,12 +69,6 @@ B 0 0 1 2 3 ``` So the length of LCS is `dp[4][4] = 3`. -#### Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Longest%20Common%20Subsequence.cpp) - #### Video Explanation [Video explanation by Tushar Roy](https://youtu.be/NnD96abizww) diff --git a/en/Greedy Algorithms/Fractional Knapsack.md b/en/Greedy Algorithms/Fractional Knapsack.md index cc9eb8c8..fb49dab1 100644 --- a/en/Greedy Algorithms/Fractional Knapsack.md +++ b/en/Greedy Algorithms/Fractional Knapsack.md @@ -35,12 +35,6 @@ We won't be able to make more money by combining diverse things. ``` -#### Code Implementation Links - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/knapsack.cpp) -- [Python](https://github.com/TheAlgorithms/Python/tree/master/knapsack) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/tree/master/Algorithms/Knapsack) - #### Video Explanation [A CS50 video explaining the Greedy Algorithm](https://www.youtube.com/watch?v=Ou9OA0yQCYA) diff --git a/en/Image Processing/Harris Detector.md b/en/Image Processing/Harris Detector.md index a0b7388e..16b5f3ed 100644 --- a/en/Image Processing/Harris Detector.md +++ b/en/Image Processing/Harris Detector.md @@ -13,10 +13,6 @@ Given image $I$, $n\times n$ size Gaussian Kernel $G_{n\times n}$, 3. Compute the response function $R$, where $R=AB-C^2-k(A+B)$ 4. Classify all points in $R​$. -## Code Implementation Links - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/computer_vision/harriscorner.py) - ## Reference C. Harris and M. Stephens, “A Combined Corner and Edge Detector,” in *Proceedings of the Alvey Vision Conference 1988*, Manchester, 1988, pp. 23.1-23.6. diff --git a/en/Search Algorithms/Binary Search.md b/en/Search Algorithms/Binary Search.md index 3f18817e..ff704de5 100644 --- a/en/Search Algorithms/Binary Search.md +++ b/en/Search Algorithms/Binary Search.md @@ -38,14 +38,6 @@ target = 9 A simple Binary Search implementation may return -1 as 9 is not present in the array. A more complex one would return the index at which 9 would have to be inserted, which would be `-8` (last position in the array (7) plus one (7+1), negated)`. ``` -#### Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/BinarySearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/binary_search.c) - #### Video Explanation [A CS50 video explaining the Binary Search Algorithm](https://www.youtube.com/watch?v=5xlIPT1FRcA) diff --git a/en/Search Algorithms/Exponential Search.md b/en/Search Algorithms/Exponential Search.md index 8c363cc2..bca641ab 100644 --- a/en/Search Algorithms/Exponential Search.md +++ b/en/Search Algorithms/Exponential Search.md @@ -53,9 +53,3 @@ Let's take a look at this comparison with a less theoretical example. Imagine we - The Binary Search start from the middle of the array and arrive to the 4th position after many iterations - The Exponential Search arrive at the 4th index after only 2 iterations - -#### Code Implementation Links - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/exponential_search.cpp) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/exponential_search.c) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/ExponentialSearch.js) diff --git a/en/Search Algorithms/Floyd Cycle Detection Algorithm to Find Duplicate Number.md b/en/Search Algorithms/Floyd Cycle Detection Algorithm to Find Duplicate Number.md index b23d0a56..a431d58d 100644 --- a/en/Search Algorithms/Floyd Cycle Detection Algorithm to Find Duplicate Number.md +++ b/en/Search Algorithms/Floyd Cycle Detection Algorithm to Find Duplicate Number.md @@ -67,10 +67,6 @@ tortoise = arr[0] = 3 return tortoise = 4 ``` -## Code Implementation Links - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/floyd_cycle_detection_algo.cpp) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/floyd_cycle_detection_algorithm.c) #### Video Explanation - [YouTube video explaining the Floyd Cycle Detection algorithm](https://www.youtube.com/watch?v=B6smdk7pZ14) diff --git a/en/Search Algorithms/Linear Search.md b/en/Search Algorithms/Linear Search.md index eb6f90bf..4da70e54 100644 --- a/en/Search Algorithms/Linear Search.md +++ b/en/Search Algorithms/Linear Search.md @@ -33,13 +33,6 @@ target = 6 Linear Search should return -1 as 6 is not present in the array ``` -#### Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/linear_search.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/linear_search.c) - #### Video Explanation [A CS50 video explaining the Linear Search Algorithm](https://www.youtube.com/watch?v=CX2CYIJLwfg) diff --git a/en/Selection Algorithms/Find Second Largest Element.md b/en/Selection Algorithms/Find Second Largest Element.md index 32e21904..14971faa 100644 --- a/en/Selection Algorithms/Find Second Largest Element.md +++ b/en/Selection Algorithms/Find Second Largest Element.md @@ -65,10 +65,6 @@ True : b = arr[6] (b = 25) Now we get the value 25 in the variable "b", which is the second highest value in the array. ``` -#### Code Implementation Links - -[JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/FindSecondLargestElement.js) - #### Video Explanation [Video explaining 2 approaches](https://www.youtube.com/watch?v=Mv8jhYQEbkA) diff --git a/en/Selection Algorithms/Quick Select.md b/en/Selection Algorithms/Quick Select.md index 706dcb97..cc915e4e 100644 --- a/en/Selection Algorithms/Quick Select.md +++ b/en/Selection Algorithms/Quick Select.md @@ -41,13 +41,6 @@ Let's say k = 4. ie. We have to find 4th smallest element. 4. As position of '7' is 4th (ie. k). Thus we will simply return 7 ``` -### Code Implementation Links - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/QuickSelect.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/quick_select.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/search/selectk.go) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Data-Structures/Array/QuickSelect.js) - ### Helpful Video Links [Video explaining how to find the Kth smallest/largest element in varying complexities](https://youtu.be/hGK_5n81drs) diff --git a/en/Sorting Algorithms/Bubble Sort.md b/en/Sorting Algorithms/Bubble Sort.md index 665f2bf9..3ce99615 100644 --- a/en/Sorting Algorithms/Bubble Sort.md +++ b/en/Sorting Algorithms/Bubble Sort.md @@ -79,34 +79,6 @@ Indexes: 0 1 2 3 Since there are no swaps in above steps, it means the array is sorted and we can stop here. ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/bubble_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/bubble_Sort.dart) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/sorting/bubble_sort.ex) -- [Elm](https://github.com/TheAlgorithms/Elm/blob/master/src/Sorting/BubbleSort.elm) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Sort/Bubble_Sort.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/bubblesort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/BubbleSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/BubbleSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/bubble_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/BubbleSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/bubblesort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/bubble_sort.m) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/BubbleSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/bubble_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/bubble_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/bubble_sort.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/BubbleSort.scala) -- [Solidity](https://github.com/TheAlgorithms/Solidity/blob/main/src/Sorts/BubbleSort.sol) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/sorts/BubbleSort.swift) -- [TypeScript](https://github.com/TheAlgorithms/TypeScript/blob/master/sorts/bubble_sort.ts) - #### Video Explanation [A video explaining the Bubble Sort Algorithm](https://www.youtube.com/watch?v=Jdtq5uKz-w4) diff --git a/en/Sorting Algorithms/Counting Sort.md b/en/Sorting Algorithms/Counting Sort.md index 1fdc7781..984d28bc 100644 --- a/en/Sorting Algorithms/Counting Sort.md +++ b/en/Sorting Algorithms/Counting Sort.md @@ -41,22 +41,6 @@ countingSort(array, size) decrease count of each element restored by 1 ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/counting_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/counting_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/counting_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/count_sort.dart) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/countingsort.go) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/CountingSort.java) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/CountingSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/counting_sort.jl) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/counting_sort.m) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/CountSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/counting_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/counting_sort.r) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/counting_sort.rs) - #### Video Explanation [A video explaining the Counting Sort Algorithm](https://www.youtube.com/watch?v=7zuGmKfUt7s) diff --git a/en/Sorting Algorithms/Heap Sort.md b/en/Sorting Algorithms/Heap Sort.md index 55a73d3b..7b545351 100644 --- a/en/Sorting Algorithms/Heap Sort.md +++ b/en/Sorting Algorithms/Heap Sort.md @@ -55,28 +55,6 @@ in top down manner. ![heap-image](https://upload.wikimedia.org/wikipedia/commons/1/1b/Sorting_heapsort_anim.gif "Heap Sort") -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/heap_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/HeapSorter.cs) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/heap_Sort.dart) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Sort/Heap_Sort.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/heapsort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/InsertionSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/HeapSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/heap_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/HeapSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/heapsort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/heap_sort.m) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/heap_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/heap_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/heap_sort.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/HeapSort.scala) - #### Video Explanation [A video explaining the Heap Sort Algorithm](https://www.youtube.com/watch?v=MtQL_ll5KhQ) diff --git a/en/Sorting Algorithms/Insertion Sort.md b/en/Sorting Algorithms/Insertion Sort.md index 6356815c..d1253151 100644 --- a/en/Sorting Algorithms/Insertion Sort.md +++ b/en/Sorting Algorithms/Insertion Sort.md @@ -48,34 +48,6 @@ and elements from 11 to 13 will move one position ahead of their current positio 5, 6, 11, 12, 13 -- sorted array ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/insertion_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/insert_Sort.dart) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/sorting/insertion_sort.ex) -- [Elm](https://github.com/TheAlgorithms/Elm/blob/master/src/Sorting/InsertionSort.elm) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Sort/Insertion_Sort.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/insertionsort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/InsertionSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/InsertionSort.java) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/InsertionSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/insertion_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/InsertionSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/insertionsort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/insertion_sort.m) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/InsertionSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/insertion_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/insertion_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/insertion_sort.rs) -- [Scala Iterative](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/InsertionSort.scala) -- [Scala Recursive](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/RecursiveInsertionSort.scala) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/sorts/InsertionSort.swift) -- [TypeScript](https://github.com/TheAlgorithms/TypeScript/blob/master/sorts/insertion_sort.ts) - #### Video Explanation [A CS50 video explaining the Insertion Search Algorithm](https://www.youtube.com/watch?v=DFG-XuyPYUQ) diff --git a/en/Sorting Algorithms/Merge Sort.md b/en/Sorting Algorithms/Merge Sort.md index 08a3d541..d26b6275 100644 --- a/en/Sorting Algorithms/Merge Sort.md +++ b/en/Sorting Algorithms/Merge Sort.md @@ -59,31 +59,6 @@ Similarly [3, 7] and [4, 6] will be merged and made [3, 4, 6, 7]. At the next stack level [1, 2, 5, 9] and [3, 4, 6, 7] will be merged and we will get the final sorted array as [1, 2, 3, 4, 5, 6, 7, 9]. ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/merge_sort.s) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/merge_sort.dart) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/sorting/merge_sort.ex) -- [Elm](https://github.com/TheAlgorithms/Elm/blob/master/src/Sorting/MergeSort.elm) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Sort/Merge_Sort.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/mergesort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/MergeSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/MergeSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/merge_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/MergeSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/mergesort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/merge_sort.m) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/MergeSort.php) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/merge_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/merge_sort.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/MergeSort.scala) -- [Solidity](https://github.com/TheAlgorithms/Solidity/blob/main/src/Sorts/MergeSort.sol) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/sorts/MergeSort.swift) -- [TypeScript](https://github.com/TheAlgorithms/TypeScript/blob/master/sorts/merge_sort.ts) - #### Video Explanation [A CS50 video explaining the Merge Sort Algorithm](https://www.youtube.com/watch?v=EeQ8pwjQxTM) diff --git a/en/Sorting Algorithms/Quick Sort.md b/en/Sorting Algorithms/Quick Sort.md index bbd9b65e..666e0c46 100644 --- a/en/Sorting Algorithms/Quick Sort.md +++ b/en/Sorting Algorithms/Quick Sort.md @@ -66,35 +66,6 @@ Now 70 is at its correct place. All elements smaller than it. ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/quick_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/quick_sort.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/QuickSorter.cs) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/quick_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/quick_Sort.dart) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/sorting/quick_sort.ex) -- [F#](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Sort/Quick_Sort.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/quicksort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/QuickSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/QuickSort.java) -- [JavaScript Iterative](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/QuickSort.js) -- [JavaScript Recursive](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/QuickSortRecursive.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/quick_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/QuickSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/quicksort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/quick_sort.m) -- [OCaml](https://github.com/TheAlgorithms/OCaml/blob/master/Sorts/quicksort.ml) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/QuickSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/quick_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/quick_sort.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/QuickSort.scala) -- [Solidity](https://github.com/TheAlgorithms/Solidity/blob/main/src/Sorts/QuickSort.sol) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/sorts/QuickSort.swift) -- [TypeScript](https://github.com/TheAlgorithms/TypeScript/blob/master/sorts/quick_sort.ts) - #### Video Explanation [A video explaining the Quick Sort Algorithm](https://www.youtube.com/watch?v=COk73cpQbFQ) diff --git a/en/Sorting Algorithms/Radix Sort.md b/en/Sorting Algorithms/Radix Sort.md index c8605f19..0e474d06 100644 --- a/en/Sorting Algorithms/Radix Sort.md +++ b/en/Sorting Algorithms/Radix Sort.md @@ -46,24 +46,6 @@ If we have `log2n` bits for every digit, the running time of Radix appears to be asymptotic notation are higher for Radix Sort and Quick-Sort uses hardware caches more effectively. Also, Radix sort uses counting sort as a subroutine and counting sort takes extra space to sort numbers. -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/radix_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/radix_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/radix_sort.cpp) -- [C#](https://github.com/TheAlgorithms/C-Sharp/tree/master/Algorithms/Sorters/Integer/RadixSorter.cs) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/radix_sort.dart) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/radixsort.go) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/RadixSort.java) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/RadixSort.js) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/radixsort.lua) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/RadixSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/radix_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/radix_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/radix_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/radix_sort.rs) -- [Zig](https://github.com/TheAlgorithms/Zig/blob/main/sort/radixSort.zig) - #### Video Explanation Video reference: https://youtu.be/nu4gDuFabIM diff --git a/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md b/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md index ef0b1972..0c66b6b6 100644 --- a/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md +++ b/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md @@ -63,11 +63,6 @@ void bubbleSort(arr[], n) bubbleSort(arr, n-1) ``` -## Implementations - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSortRecursion.java) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort_recursion.c) - ## Video Explanation [A video explaining iterative as well as recursive bubble sort](https://www.youtube.com/watch?v=gDMDVLBfCI0) diff --git a/en/Sorting Algorithms/Selection Sort.md b/en/Sorting Algorithms/Selection Sort.md index f9552f04..713b2d41 100644 --- a/en/Sorting Algorithms/Selection Sort.md +++ b/en/Sorting Algorithms/Selection Sort.md @@ -49,35 +49,6 @@ Indexes: 0 1 2 3 The array is now sorted. ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/selection_sort.s) -- [C iterative](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort.c) -- [C recursive](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort_recursive.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/SelectionSorter.cs) -- [C++ Iterative](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/selection_sort_iterative.cpp) -- [C++ Recursive](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/selection_sort_recursive.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/select_Sort.dart) -- [Elixir](https://github.com/TheAlgorithms/Elixir/blob/master/lib/sorting/selection_sort.ex) -- [Elm](https://github.com/TheAlgorithms/Elm/blob/master/src/Sorting/SelectionSort.elm) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/selectionsort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/SelectionSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/SelectionSort.js) -- [Julia](https://github.com/TheAlgorithms/Julia/blob/main/src/sorts/selection_sort.jl) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/sort/SelectionSort.kt) -- [Lua](https://github.com/TheAlgorithms/Lua/blob/main/src/sorting/selectionsort.lua) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/select_sort.m) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/Sorting/SelectionSort.php) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py) -- [R](https://github.com/TheAlgorithms/R/blob/master/sorting_algorithms/selection_sort.r) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/selection_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/selection_sort.rs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala) -- [Solidity](https://github.com/TheAlgorithms/Solidity/blob/main/src/Sorts/SelectionSort.sol) -- [Swift](https://github.com/TheAlgorithms/Swift/blob/master/sorts/SelectionSort.swift) -- [TypeScript](https://github.com/TheAlgorithms/TypeScript/blob/master/sorts/selection_sort.ts) - #### Video Explanation [A video explaining the Selection Sort Algorithm](https://www.youtube.com/watch?v=f8hXR_Hvybo) diff --git a/en/Sorting Algorithms/Shell Sort.md b/en/Sorting Algorithms/Shell Sort.md index 06e59764..94b94060 100644 --- a/en/Sorting Algorithms/Shell Sort.md +++ b/en/Sorting Algorithms/Shell Sort.md @@ -54,23 +54,6 @@ Initial Gap: 4 12. Divide the gap by 2 and repeat until gap = 1 ``` -#### Code Implementation Links - -- [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/shell_sort.s) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/shell_sort.c) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/ShellSorter.cs) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/shell_sort.cpp) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/sort/shell_Sort.dart) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/shellsort.go) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/ShellSort.hs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/ShellSort.java) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/shellSort.js) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/shell_sort.m) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/shell_sort.rb) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/shell_sort.rs) - - #### Video Explanation [A video explaining the Shell Sort Algorithm](https://www.youtube.com/watch?v=H8NiFkGu2PY) diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md b/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md index 7f473370..2e1b0be4 100644 --- a/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md +++ b/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md @@ -79,18 +79,6 @@ Indices: 0 1 2 3 Como no hay intercambios en los pasos de arriba, el arreglo ya se ha ordenado y nos podemos detener. ``` -#### Enlaces a implementaciones de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Bubble%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/bubblesort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/bubble_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/BubbleSort.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/BubbleSort.scala) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/BubbleSort.js) - #### Explicación en video [Un video explicando el Algoritmo de Ordenamiento Burbuja](https://www.youtube.com/watch?v=EQMGabLO_M0) diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md b/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md index 7ae4c0d3..3c4aa1e7 100644 --- a/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md +++ b/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md @@ -55,17 +55,6 @@ Brecha inicial: 4 12. Divida la brecha por 2 y repita hasta la brecha = 1 ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/ShellSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Shell%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/ShellSorter.cs) -- [Ir](https://github.com/TheAlgorithms/Go/blob/master/sort/shellsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/shell_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/shellSort.c) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/ShellSort.js) - #### Explicación de vídeo [Un vídeo explicando el algoritmo del ordenamiento de Shell](https://www.youtube.com/watch?v=H8NiFkGu2PY) diff --git "a/es/Algoritmos de Ordenamiento/Ordenamiento de fusi\303\263n.md" "b/es/Algoritmos de Ordenamiento/Ordenamiento de fusi\303\263n.md" index f0122536..02df6850 100644 --- "a/es/Algoritmos de Ordenamiento/Ordenamiento de fusi\303\263n.md" +++ "b/es/Algoritmos de Ordenamiento/Ordenamiento de fusi\303\263n.md" @@ -31,12 +31,6 @@ Vuelva a llamar a la función de ordenación de combinación de llamadas para es Ahora combine ambas mitades para obtener la matriz ordenada [0, 1, 2, 3, 5, 9] ``` -#### Enlaces de la implementación del código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb) - #### Explicación de vídeo [Un vídeo CS50 que explica el algoritmo de ordemaniento de fusión](https://www.youtube.com/watch?v=EeQ8pwjQxTM) diff --git "a/es/Algoritmos de Ordenamiento/Ordenamiento de inserci\303\263n.md" "b/es/Algoritmos de Ordenamiento/Ordenamiento de inserci\303\263n.md" index 013e7089..20a9d11d 100644 --- "a/es/Algoritmos de Ordenamiento/Ordenamiento de inserci\303\263n.md" +++ "b/es/Algoritmos de Ordenamiento/Ordenamiento de inserci\303\263n.md" @@ -47,16 +47,6 @@ y los elementos del 11 al 13 se moverán una posición por delante de su posici 5, 6, 11, 12, 13 -- matriz ordenada ``` -#### Enlaces de implementación del código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/InsertionSort.java) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/InsertionSort.scala) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/insertion_sort.rb) - #### Explicación de vídeo [Un vídeo CS50 que explica el algoritmo de Ordenamiento de inserción](https://www.youtube.com/watch?v=DFG-XuyPYUQ) diff --git "a/es/Algoritmos de Ordenamiento/Ordenamiento de mont\303\263n (heap sort).md" "b/es/Algoritmos de Ordenamiento/Ordenamiento de mont\303\263n (heap sort).md" index 5007099b..2732ff73 100644 --- "a/es/Algoritmos de Ordenamiento/Ordenamiento de mont\303\263n (heap sort).md" +++ "b/es/Algoritmos de Ordenamiento/Ordenamiento de mont\303\263n (heap sort).md" @@ -55,17 +55,6 @@ El procedimiento de amontonar se llama a sí mismo recursivamente para construir ![imagen del montón](https://upload.wikimedia.org/wikipedia/commons/1/1b/Sorting_heapsort_anim.gif "Heap sort") -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py) -- [Ir](https://github.com/TheAlgorithms/Go/blob/master/sort/heapsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/heap_sort.rb) -- [C-sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/HeapSorter.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort.c) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/HeapSort.js) - #### Explicación de vídeo [Un vídeo explicando el algoritmo de ordenamiento de montón (heap sort)](https://www.youtube.com/watch?v=MtQL_ll5KhQ) diff --git "a/es/Algoritmos de Ordenamiento/Ordenamiento de selecci\303\263n.md" "b/es/Algoritmos de Ordenamiento/Ordenamiento de selecci\303\263n.md" index d2447869..8aaa49cb 100644 --- "a/es/Algoritmos de Ordenamiento/Ordenamiento de selecci\303\263n.md" +++ "b/es/Algoritmos de Ordenamiento/Ordenamiento de selecci\303\263n.md" @@ -49,17 +49,6 @@ arr[] = {80, 10, 40, 30} La matriz ahora está ordenada. ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Selection%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py) -- [Ir](https://github.com/TheAlgorithms/Go/blob/master/sort/selectionsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/selection_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/SelectionSort.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/SelectionSort.js) - #### Explicación de vídeo [Un vídeo explicando el algoritmo de Ordenamiento de selección](https://www.youtube.com/watch?v=f8hXR_Hvybo) diff --git "a/es/Algoritmos de Ordenamiento/Ordenamiento r\303\241pido.md" "b/es/Algoritmos de Ordenamiento/Ordenamiento r\303\241pido.md" index 837997b5..62c9dfd9 100644 --- "a/es/Algoritmos de Ordenamiento/Ordenamiento r\303\241pido.md" +++ "b/es/Algoritmos de Ordenamiento/Ordenamiento r\303\241pido.md" @@ -67,13 +67,6 @@ Ahora 70 está en su lugar correcto. Todos los elementos más pequeños que eso. ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/QuickSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Quick%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb) - #### Explicación de vídeo [Un vídeo explicando el algoritmo de ordenamiento rápido](https://www.youtube.com/watch?v=COk73cpQbFQ) diff --git "a/es/Algoritmos de b\303\272squeda/B\303\272squeda binaria.md" "b/es/Algoritmos de b\303\272squeda/B\303\272squeda binaria.md" index cb6ce132..089c1566 100644 --- "a/es/Algoritmos de b\303\272squeda/B\303\272squeda binaria.md" +++ "b/es/Algoritmos de b\303\272squeda/B\303\272squeda binaria.md" @@ -38,24 +38,6 @@ target = 9 Búsqueda binaria debe devolver -1 dado que 9 no está presente en la matriz ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/BinarySearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/Binary_Search.c) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/BinarySearch.js) -- [Haskell](https://github.com/TheAlgorithms/Haskell/blob/master/src/Misc/BinarySearch.hs) -- [F-Sharp](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Search/BinarySearch.fs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/search/binary.go) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/searching/binary_search.rs) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/search/binary_Search.dart) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Searches/binary_search.rb) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/searches/binary_search.php) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Search/BinarySearch.scala) -- [MATLAB-Octave](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/Searching/binary_search.m) - #### Explicación en vídeo de YouTube [Un vídeo CS50 explicando el algoritmo de búsqueda binaria](https://www.youtube.com/watch?v=5xlIPT1FRcA) diff --git "a/es/Algoritmos de b\303\272squeda/B\303\272squeda exponencial.md" "b/es/Algoritmos de b\303\272squeda/B\303\272squeda exponencial.md" index fbb2c658..3dad7976 100644 --- "a/es/Algoritmos de b\303\272squeda/B\303\272squeda exponencial.md" +++ "b/es/Algoritmos de b\303\272squeda/B\303\272squeda exponencial.md" @@ -53,8 +53,3 @@ Echemos un vistazo a esta comparación con un ejemplo menos teórico. Imagine qu - La búsqueda binaria comienza desde el centro de la matriz y llega a la 4ª posición después de muchas iteraciones - La búsqueda exponencial llega al 4º índice después de sólo 2 iteraciones - -#### Enlaces de implementación de código - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/exponential_search.cpp) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/ExponentialSearch.js) diff --git "a/es/Algoritmos de b\303\272squeda/B\303\272squeda lineal.md" "b/es/Algoritmos de b\303\272squeda/B\303\272squeda lineal.md" index 7d8f827d..1e86ff63 100644 --- "a/es/Algoritmos de b\303\272squeda/B\303\272squeda lineal.md" +++ "b/es/Algoritmos de b\303\272squeda/B\303\272squeda lineal.md" @@ -33,23 +33,6 @@ target = 6 La búsqueda lineal debe devolver -1 ya que 6 no está presente en la matriz ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/LinearSearch.js) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/LinearSearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/linear_search.c) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/search/linear.go) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/searching/linear_search.rs) -- [Dart](https://github.com/TheAlgorithms/Dart/blob/master/search/linear_Search.dart) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Searches/linear_search.rb) -- [PHP](https://github.com/TheAlgorithms/PHP/blob/master/searches/linear_search.php) -- [Kotlin](https://github.com/TheAlgorithms/Kotlin/blob/master/src/main/kotlin/search/LinearSearch.kt) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Search/LinearSearch.scala) -- [OCaml](https://github.com/TheAlgorithms/OCaml/blob/master/searches/linear_search.ml) -- [MATLAB-Octave](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/Searching/linear_search.m) - #### Explicación en YouTube [Un vídeo CS50 que explica el algoritmo de búsqueda lineal](https://www.youtube.com/watch?v=CX2CYIJLwfg) diff --git "a/es/Algoritmos de selecci\303\263n/Selecci\303\263n R\303\241pida.md" "b/es/Algoritmos de selecci\303\263n/Selecci\303\263n R\303\241pida.md" index 8d40f9fa..d15428ee 100644 --- "a/es/Algoritmos de selecci\303\263n/Selecci\303\263n R\303\241pida.md" +++ "b/es/Algoritmos de selecci\303\263n/Selecci\303\263n R\303\241pida.md" @@ -39,11 +39,6 @@ Digamos que k = 4 y tenemos que encontrar el cuarto elemento menor: 4. Como la posición de '7' es la cuarta, simplemente devolveremos el valor 7. ``` -## Enlaces de implementaciones de código - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/selecting/quickSelect.cpp) -- [Python](https://programmerclick.com/article/92711720579/) - ## Enlaces de explicación en vídeo [Programación en C++, Ordenamiento por Selección](https://www.youtube.com/watch?v=HVa2_UtXkCI) diff --git a/es/Cifrado/Cifrado Cesar.md b/es/Cifrado/Cifrado Cesar.md index 5f62140a..daf35af8 100644 --- a/es/Cifrado/Cifrado Cesar.md +++ b/es/Cifrado/Cifrado Cesar.md @@ -38,9 +38,3 @@ Digamos que estamos enviando un mensaje secreto a un amigo. * La segunda letra es `h`. La letra a 6 letras de distancia es `n`. Nuestro mensaje ahora es `Zn` * Seguimos así hasta el final. Nuestro mensaje final es: `Znk Igkygx iovnkx oy g lat yahyzozazout iovnkx.` * El descifrado es de la misma manera, excepto que en lugar de ir a la derecha en el alfabeto, vamos hacia atrás. - -## Implementación - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/ciphers/caesar_cipher.py) -* [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/caesar_cipher.cpp) -* [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/ciphers/caesar.rs) diff --git "a/es/Estructuras de datos/Gr\303\241fico/Bellman Ford.md" "b/es/Estructuras de datos/Gr\303\241fico/Bellman Ford.md" index 1e32bba7..d3908206 100644 --- "a/es/Estructuras de datos/Gr\303\241fico/Bellman Ford.md" +++ "b/es/Estructuras de datos/Gr\303\241fico/Bellman Ford.md" @@ -86,13 +86,6 @@ D -2 A->B->E->D = -1 + 2 + -3 E 1 A->B->E = -1 + 2 ``` -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Bellman-Ford.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/graph/bellman_ford.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/Bellman-Ford.c) - #### Explicación de vídeo [Un video explicando el algoritmo Bellman Ford](https://www.youtube.com/watch?v=hxMWBBCpR6A) diff --git a/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md b/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md index e4492ee7..6cd9548a 100644 --- a/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md +++ b/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md @@ -102,14 +102,6 @@ class LinkedList { ![Seguimiento del algoritmo](https://www.geeksforgeeks.org/wp-content/uploads/gq/2014/03/DLL_add_middle1.png) -## Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/double_list.rb) - ## Explicación de vídeo [Un vídeo CS50 explicando la Estructura de Datos de la Lista Doblemente Vinculada](https://www.youtube.com/watch?v=FHMPswJDCvU) diff --git a/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md b/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md index bbf71447..8be7ca58 100644 --- a/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md +++ b/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md @@ -37,11 +37,6 @@ class LinkedList { } ``` -## Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py) ## Explicación de vídeo diff --git "a/es/Matematicas B\303\241sico/Numeros_Fibonacci.md" "b/es/Matematicas B\303\241sico/Numeros_Fibonacci.md" index 121518ee..23778eed 100644 --- "a/es/Matematicas B\303\241sico/Numeros_Fibonacci.md" +++ "b/es/Matematicas B\303\241sico/Numeros_Fibonacci.md" @@ -65,13 +65,6 @@ Calcular matriz^8 F(8)=21 -## Implementación - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/FibonacciNumber.java) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) - ## Video en YouTube - [YouTube](https://www.youtube.com/watch?v=EEb6JP3NXBI) diff --git "a/es/Matematicas B\303\241sico/Promedio.md" "b/es/Matematicas B\303\241sico/Promedio.md" index ee2ca0ef..6735c765 100644 --- "a/es/Matematicas B\303\241sico/Promedio.md" +++ "b/es/Matematicas B\303\241sico/Promedio.md" @@ -58,10 +58,6 @@ Si consideramos correctamente dígitos significativos: `suma / recuento = 23` Devuelva el valor de 22. 857142 o `23`. -## Implementación - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mean.py) - ## Video en YouTube - [Media en Khan Academy](https://www.khanacademy.org/math/ap-statistics/summarizing-quantitative-data-ap/measuring-center-quantitative/v/mean-media-and-mode) diff --git a/es/Procesamiento de imagenes/Detector de Harris.md b/es/Procesamiento de imagenes/Detector de Harris.md index 6046196b..b171a86f 100644 --- a/es/Procesamiento de imagenes/Detector de Harris.md +++ b/es/Procesamiento de imagenes/Detector de Harris.md @@ -13,10 +13,6 @@ Dada la imagen `$I$`, $ntimes n$ tamaño Gaussian Kernel `$G_{ntimes n}$`, 3. Calcule la función de respuesta `$R$`, donde `$R=AB-C^2-k(A+B)$` 4. Clasifique todos los puntos en `$R$`. -## Enlaces de implementación de código - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/digital_image_processing/feature_detectors/harris.py) - ## Referencia C. Harris y M. Stephens, "A Combined Corner and Edge Detector", en *Procedings of the Alvey Vision Conference 1988*, Manchester, 1988, págs. 23.1-23.6. diff --git "a/es/Programaci\303\263n dinamica/Cambio de monedas.md" "b/es/Programaci\303\263n dinamica/Cambio de monedas.md" index 92bd4425..7e1228a4 100644 --- "a/es/Programaci\303\263n dinamica/Cambio de monedas.md" +++ "b/es/Programaci\303\263n dinamica/Cambio de monedas.md" @@ -58,15 +58,6 @@ Digamos que tenemos 3 tipos de monedas `[1,2,3]`, y queremos cambiarlas por 7 ce Así que la respuesta final es **8**. 8 maneras de hacer un cambio de 7 centavos usando todos los tipos de monedas. `{{1,1,1,1,1,1,1}, {1,1,1,1,1,2}, {1,1,1,2,2}, {1,2,2,2}, {1,1,1,1,3}, {1,3,3}, {2,2,3}, {1,1,2,3}}` -#### Enlace de implementación de código - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/coin_change.py) -* [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/coin_change.cpp) -* [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java) -* [Dart](https://github.com/TheAlgorithms/Dart/blob/master/dynamic_programming/coin_change.dart) -* [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/dynamic_programming/coin_change.rb) -* [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/DynamicProgramming/CoinChange.scala) - #### Vídeo de explicación [Formas únicas totales de hacer el cambio de espaldas a espaldas SWE](https://www.youtube.com/watch?v=DJ4a7cmjZY0) diff --git "a/es/Programaci\303\263n dinamica/Subsecuencia com\303\272n m\303\241s larga.md" "b/es/Programaci\303\263n dinamica/Subsecuencia com\303\272n m\303\241s larga.md" index 3b40b70f..d51e4f55 100644 --- "a/es/Programaci\303\263n dinamica/Subsecuencia com\303\272n m\303\241s larga.md" +++ "b/es/Programaci\303\263n dinamica/Subsecuencia com\303\272n m\303\241s larga.md" @@ -75,15 +75,6 @@ B 0 0 1 2 3 Así que la longitud de LCS es `dp[4] [4] = 3`. -#### Enlaces de implementación de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Longest%20Common%20Subsequence.cpp) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Dynamic-Programming/LongestCommonSubsequence.js) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/dynamic/longestcommonsubsequence.go) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/longest_common_subsequence.rs) - #### Explicación en YouTube [Explicación en YouTube de Tushar Roy](https://youtu.be/NnD96abizww) diff --git a/fr/filtres_audio/filtre_butterworth.md b/fr/filtres_audio/filtre_butterworth.md index 85b5d226..b02fc4ba 100644 --- a/fr/filtres_audio/filtre_butterworth.md +++ b/fr/filtres_audio/filtre_butterworth.md @@ -27,7 +27,3 @@ $$\tag{avec $p_k=\omega_ce^{\frac{j(2k+n-1)\pi}{2n}}$}H(p) = \frac{G_0}{\prod^n_ * On commence par calculer les différents coefficients pour le filtre. * On applique ces coefficients à un filtre IIR. - -## Implementation - -* [Python](https://github.com/TheAlgorithms/Python/audio_filters/butterworth_filter.py) diff --git a/fr/math/Determinant.md b/fr/math/Determinant.md index 57feedd4..717bdb0c 100644 --- a/fr/math/Determinant.md +++ b/fr/math/Determinant.md @@ -34,7 +34,3 @@ Calculons le déterminant de la matrice $\begin{bmatrix}1&2&3\\4&5&6\\7&8&9\end{ ### Conclusion Le déterminant de $\begin{bmatrix}1&2&3\\4&5&6\\7&8&9\end{bmatrix}$ est $0$. - -## Implémentation - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/linear_algebra/src/lib.py) diff --git a/fr/math/Suite_de_Fibonacci.md b/fr/math/Suite_de_Fibonacci.md index c52ad099..b6ce3d60 100644 --- a/fr/math/Suite_de_Fibonacci.md +++ b/fr/math/Suite_de_Fibonacci.md @@ -40,7 +40,3 @@ Dans notre exemple nous cherchons à calculer F(6), le 7ème terme de la suite. ### Conclusion On a donc $F(6) = 8$ - -## Implémentation - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) diff --git "a/fr/math/Suite_de_Fibonacci_r\303\251cursive.md" "b/fr/math/Suite_de_Fibonacci_r\303\251cursive.md" index e4549d03..12506035 100644 --- "a/fr/math/Suite_de_Fibonacci_r\303\251cursive.md" +++ "b/fr/math/Suite_de_Fibonacci_r\303\251cursive.md" @@ -41,7 +41,3 @@ Dans notre exemple nous cherchons à calculer $F(4)$, le 5ème terme de la suite ### Conclusion On a donc $F(4) = 3$ - -## Implémentation - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci_sequence_recursion.py) diff --git a/fr/tri/Tri_fusion.md b/fr/tri/Tri_fusion.md index 359887be..b2b12e4c 100644 --- a/fr/tri/Tri_fusion.md +++ b/fr/tri/Tri_fusion.md @@ -46,11 +46,3 @@ De même, [3, 7] et [4, 6] seront fusionnés et donneront [3, 4, 6, 7]. Au niveau suivant de la pile, [1, 2, 5, 9] et [3, 4, 6, 7] seront fusionnés et nous obtiendrons le tableau trié final comme [1, 2, 3, 4, 5, 6, 7, 9]. ``` - -## Implémentation - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/mergesort.go) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/MergeSort.js) \ No newline at end of file diff --git a/fr/tri/Tri_par_insertion.md b/fr/tri/Tri_par_insertion.md index 7ac6b5aa..b03c5b02 100644 --- a/fr/tri/Tri_par_insertion.md +++ b/fr/tri/Tri_par_insertion.md @@ -44,10 +44,6 @@ Tri par insertion dans le : * [meilleur cas](../Exemples/tri/TriInsertionMeilleur.mp4) * [pire cas](../Exemples/tri/TriInsertionPire.mp4) -## Implémentation - -* [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py) - ## Pour aller plus loin * Dans le meilleur cas, nous n'effectuons qu'une unique comparaison. En effet, le terme comparé et plus grand que le terme juste avant, donc aucune modification n'est à effectuer. (ce qui correspond bien à $n$ opérations) diff --git a/fr/tri/Tri_par_selection.md b/fr/tri/Tri_par_selection.md index 3e7e016c..e7f04bb6 100644 --- a/fr/tri/Tri_par_selection.md +++ b/fr/tri/Tri_par_selection.md @@ -48,16 +48,3 @@ Indexes : 0 1 2 3 Le Tableau est maintenant trié. ``` - -## Implémentation - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java) -- [C++ Iterative](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/selection_sort_iterative.cpp) -- [C++ Recursive](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/selection_sort_recursive.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/selectionsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/selection_sort.rb) -- [C iterative](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort.c) -- [C recursive](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort_recursive.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala) -- [TypeScript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/selectionSort.js) \ No newline at end of file diff --git "a/fr/tri/Tri_\303\240_bulles.md" "b/fr/tri/Tri_\303\240_bulles.md" index 540f37f0..1d460c17 100644 --- "a/fr/tri/Tri_\303\240_bulles.md" +++ "b/fr/tri/Tri_\303\240_bulles.md" @@ -73,15 +73,3 @@ Indexes: 0 1 2 3 Puisqu'il n'y a pas de permutations dans les étapes précédentes, cela signifie que le tableau est trié et que nous pouvons nous arrêter ici. ``` - -## Implémentations - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sorts/bubblesort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/bubble_sort.rb) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/BubbleSort.scala) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/BubbleSort.js) \ No newline at end of file diff --git "a/he/\327\236\327\252\327\236\327\230\327\231\327\247\327\224 \327\221\327\241\327\231\327\241\327\231\327\252/\327\236\327\241\327\244\327\250\327\231 \327\244\327\231\327\221\327\225\327\240\327\220\327\246'\327\231.md" "b/he/\327\236\327\252\327\236\327\230\327\231\327\247\327\224 \327\221\327\241\327\231\327\241\327\231\327\252/\327\236\327\241\327\244\327\250\327\231 \327\244\327\231\327\221\327\225\327\240\327\220\327\246'\327\231.md" index d2a3e9a9..52411f28 100644 --- "a/he/\327\236\327\252\327\236\327\230\327\231\327\247\327\224 \327\221\327\241\327\231\327\241\327\231\327\252/\327\236\327\241\327\244\327\250\327\231 \327\244\327\231\327\221\327\225\327\240\327\220\327\246'\327\231.md" +++ "b/he/\327\236\327\252\327\236\327\230\327\231\327\247\327\224 \327\221\327\241\327\231\327\241\327\231\327\252/\327\236\327\241\327\244\327\250\327\231 \327\244\327\231\327\221\327\225\327\240\327\220\327\246'\327\231.md" @@ -79,12 +79,6 @@ F(8)=21 ``` -

יישום סדרת פיבונאצ'י בשפות תכנות שונות

- -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) -

קישור לסרטון הסבר

- [Youtube](https://www.youtube.com/watch?v=EEb6JP3NXBI) diff --git "a/ko/\352\267\270\353\246\254\353\224\224 \354\225\214\352\263\240\353\246\254\354\246\230/\353\266\204\355\225\240 \352\260\200\353\212\245\355\225\234 \353\260\260\353\202\255 \353\254\270\354\240\234.md" "b/ko/\352\267\270\353\246\254\353\224\224 \354\225\214\352\263\240\353\246\254\354\246\230/\353\266\204\355\225\240 \352\260\200\353\212\245\355\225\234 \353\260\260\353\202\255 \353\254\270\354\240\234.md" index bbf4b9c6..02885f8c 100644 --- "a/ko/\352\267\270\353\246\254\353\224\224 \354\225\214\352\263\240\353\246\254\354\246\230/\353\266\204\355\225\240 \352\260\200\353\212\245\355\225\234 \353\260\260\353\202\255 \353\254\270\354\240\234.md" +++ "b/ko/\352\267\270\353\246\254\353\224\224 \354\225\214\352\263\240\353\246\254\354\246\230/\353\266\204\355\225\240 \352\260\200\353\212\245\355\225\234 \353\260\260\353\202\255 \353\254\270\354\240\234.md" @@ -33,12 +33,6 @@ B는 배낭의 용량보다 작기 때문에 첫 번째로 선택된다. 다음 이것이 가장 적합한 선택이다. 다른 항목을 조합하여 더 많은 돈을 버는 것은 불가능하다. ``` -#### 구현 - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/knapsack.cpp) -- [Python](https://github.com/TheAlgorithms/Python/tree/master/knapsack) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/tree/master/Algorithms/Knapsack) - #### 영상 URL [A CS50 video explaining the Greedy Algorithm](https://www.youtube.com/watch?v=Ou9OA0yQCYA) diff --git "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\354\265\234\353\214\223\352\260\222.md" "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\354\265\234\353\214\223\352\260\222.md" index 6b3596cc..2eb04336 100644 --- "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\354\265\234\353\214\223\352\260\222.md" +++ "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\354\265\234\353\214\223\352\260\222.md" @@ -85,10 +85,6 @@ `70`을 반환한다. -## 구현 - -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/find_max.rb) - ## 영상 URL - [GeeksforGeeks](https://youtu.be/En68ipRaFOU) diff --git "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\217\211\352\267\240\352\260\222.md" "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\217\211\352\267\240\352\260\222.md" index 7212ef98..e78aa369 100644 --- "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\217\211\352\267\240\352\260\222.md" +++ "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\217\211\352\267\240\352\260\222.md" @@ -55,11 +55,6 @@ count = 7 22.857142나 23을 반환한다. -## 구현 - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mean.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/average_mean.rb) - ## 영상 URL - [Khan Academy](https://www.khanacademy.org/math/ap-statistics/summarizing-quantitative-data-ap/measuring-center-quantitative/v/mean-median-and-mode) diff --git "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\224\274\353\263\264\353\202\230\354\271\230 \354\210\230.md" "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\224\274\353\263\264\353\202\230\354\271\230 \354\210\230.md" index a2d9338c..b1731808 100644 --- "a/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\224\274\353\263\264\353\202\230\354\271\230 \354\210\230.md" +++ "b/ko/\352\270\260\354\264\210 \354\210\230\355\225\231/\355\224\274\353\263\264\353\202\230\354\271\230 \354\210\230.md" @@ -65,13 +65,6 @@ F(8) = 21 ``` -## 구현 - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/FibonacciNumber.java) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) - ## 영상 URL - [Gaurav Sen](https://www.youtube.com/watch?v=EEb6JP3NXBI) diff --git "a/ko/\354\204\240\355\203\235 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\205\200\353\240\211\355\212\270.md" "b/ko/\354\204\240\355\203\235 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\205\200\353\240\211\355\212\270.md" index 7a6bdfb6..94779760 100644 --- "a/ko/\354\204\240\355\203\235 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\205\200\353\240\211\355\212\270.md" +++ "b/ko/\354\204\240\355\203\235 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\205\200\353\240\211\355\212\270.md" @@ -40,13 +40,6 @@ k = 4, 즉 4번째로 작은 원소를 찾고 싶다고 하자. 4. 7의 위치가 4번째이므로, 우리가 찾는 원소이다. 7을 반환한다. ``` -### 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/QuickSelect.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/quick_select.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/search/selectk.go) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Data-Structures/Array/QuickSelect.js) - ### 관련 영상 [여러가지 시간 복잡도에 따라 K번째로 작은/큰 원소를 찾는 방법을 설명하는 영상](https://youtu.be/hGK_5n81drs) diff --git "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\352\267\270\353\236\230\355\224\204/\353\262\250\353\250\274-\355\217\254\353\223\234 \354\225\214\352\263\240\353\246\254\354\246\230.md" "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\352\267\270\353\236\230\355\224\204/\353\262\250\353\250\274-\355\217\254\353\223\234 \354\225\214\352\263\240\353\246\254\354\246\230.md" index a632daec..037c182b 100644 --- "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\352\267\270\353\236\230\355\224\204/\353\262\250\353\250\274-\355\217\254\353\223\234 \354\225\214\352\263\240\353\246\254\354\246\230.md" +++ "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\352\267\270\353\236\230\355\224\204/\353\262\250\353\250\274-\355\217\254\353\223\234 \354\225\214\352\263\240\353\246\254\354\246\230.md" @@ -94,13 +94,6 @@ E 1 (A->B->E = -1 + 2) ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Bellman-Ford.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/graph/bellman_ford.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/Bellman-Ford.c) - ## 영상 URL - [Yusuf Shakeel (C)](https://www.youtube.com/watch?v=hxMWBBCpR6A) diff --git "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\353\213\250\354\235\274 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\353\213\250\354\235\274 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" index e2402b33..b4057b57 100644 --- "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\353\213\250\354\235\274 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" +++ "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\353\213\250\354\235\274 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" @@ -38,12 +38,6 @@ class LinkedList { } ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=5nsKtQuT6E8) diff --git "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\233\220\355\230\225 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\233\220\355\230\225 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" index b37ad45f..d2c798d6 100644 --- "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\233\220\355\230\225 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" +++ "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\233\220\355\230\225 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" @@ -64,12 +64,6 @@ public void insertHead(int data) } ``` -## 구현 - -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Data-Structures/Linked-List/SinglyCircularLinkedList.js) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/cll/cll.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/circular_linked_list.py) - ## 영상 URL [유투브 영상](https://youtu.be/HMkdlu5sP4A) diff --git "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\235\264\354\244\221 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\235\264\354\244\221 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" index 2fb6a7f8..d91fda96 100644 --- "a/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\235\264\354\244\221 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" +++ "b/ko/\354\236\220\353\243\214\352\265\254\354\241\260/\354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270/\354\235\264\354\244\221 \354\227\260\352\262\260 \353\246\254\354\212\244\355\212\270.md" @@ -100,14 +100,6 @@ class LinkedList { } ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/double_list.rb) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=FHMPswJDCvU) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\352\263\204\354\210\230 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\352\263\204\354\210\230 \354\240\225\353\240\254.md" index a388f7e0..180ef9db 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\352\263\204\354\210\230 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\352\263\204\354\210\230 \354\240\225\353\240\254.md" @@ -41,15 +41,6 @@ countingSort(array, size) decrease count of each element restored by 1 ``` -## 구현 - -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/counting_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/counting_sort.cpp) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/CountingSort.js) -- [Matlab](https://github.com/TheAlgorithms/MATLAB-Octave/blob/master/algorithms/sorting/counting_sort.m) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/counting_sort.py) -- [Rust](https://github.com/TheAlgorithms/Rust/blob/master/src/sorting/counting_sort.rs) - ## 영상 URL - [GeeksforGeeks](https://www.youtube.com/watch?v=7zuGmKfUt7s) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254 (\354\236\254\352\267\200 \353\262\204\354\240\204).md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254 (\354\236\254\352\267\200 \353\262\204\354\240\204).md" index 2ef2515e..c4bf95dd 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254 (\354\236\254\352\267\200 \353\262\204\354\240\204).md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254 (\354\236\254\352\267\200 \353\262\204\354\240\204).md" @@ -69,11 +69,6 @@ void bubbleSort(arr[], n) bubbleSort(arr, n-1) ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/BubbleSortRecursion.java) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort_recursion.c) - ## 영상 URL - [Programming Tutorials](https://www.youtube.com/watch?v=gDMDVLBfCI0) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254.md" index 776d1982..577e27a3 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\262\204\353\270\224 \354\240\225\353\240\254.md" @@ -79,18 +79,6 @@ $O(1)$ 최악의 경우 위 단계에서 교환이 없기 때문에 배열이 정렬되었음을 의미하고, 여기서 멈출 수 있다. ``` -## 구현 - -- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp) -- [파이썬](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs) -- [고](https://github.com/TheAlgorithms/Go/blob/master/sorts/bubblesort.go) -- [루비](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/bubble_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort.c) -- [스칼라](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/BubbleSort.scala) -- [자바스크립트](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/BubbleSort.js) - ## 영상 URL - [버블정렬 알고리즘에 대한 영상 설명](https://www.youtube.com/watch?v=Jdtq5uKz-w4) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\263\221\355\225\251 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\263\221\355\225\251 \354\240\225\353\240\254.md" index fd19920c..14bf3b52 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\263\221\355\225\251 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\353\263\221\355\225\251 \354\240\225\353\240\254.md" @@ -31,12 +31,6 @@ Recursively call merge sort function for both these halves which will provide so Now merge both these halves to get the sorted array [0, 1, 2, 3, 5, 9] ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/MergeSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=EeQ8pwjQxTM) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\202\275\354\236\205 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\202\275\354\236\205 \354\240\225\353\240\254.md" index 0d66ae1a..74a9f5b2 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\202\275\354\236\205 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\202\275\354\236\205 \354\240\225\353\240\254.md" @@ -51,16 +51,6 @@ and elements from 11 to 13 will move one position ahead of their current positio 5, 6, 11, 12, 13 -- sorted array ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/InsertionSort.java) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/InsertionSort.scala) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/insertion_sort.rb) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=DFG-XuyPYUQ) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\203\235 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\203\235 \354\240\225\353\240\254.md" index 1c7eccde..28040c6d 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\203\235 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\203\235 \354\240\225\353\240\254.md" @@ -47,17 +47,6 @@ Indexes: 0 1 2 3 The array is now sorted. ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/SelectionSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Selection%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/selectionsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/selection_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/SelectionSort.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/SelectionSort.js) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=f8hXR_Hvybo) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\205\270 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\205\270 \354\240\225\353\240\254.md" index ec26cc5f..f13404cc 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\205\270 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\354\205\270 \354\240\225\353\240\254.md" @@ -52,17 +52,6 @@ Initial Gap: 4 12. Divide the gap by 2 and repeat until gap = 1 ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/ShellSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Shell%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/ShellSorter.cs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/shellsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/shell_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/shellSort.c) -- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/ShellSort.js) - ## 영상 URL - [Computer Education for All](https://www.youtube.com/watch?v=H8NiFkGu2PY) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\240\225\353\240\254.md" index e9ff369b..9acb9401 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\200\265 \354\240\225\353\240\254.md" @@ -67,13 +67,6 @@ Now 70 is at its correct place. All elements smaller than it. ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/QuickSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Quick%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb) - ## 영상 URL - [mycodeschool](https://www.youtube.com/watch?v=COk73cpQbFQ) diff --git "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\236\231 \354\240\225\353\240\254.md" "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\236\231 \354\240\225\353\240\254.md" index 446f16e4..68bc3fc3 100644 --- "a/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\236\231 \354\240\225\353\240\254.md" +++ "b/ko/\354\240\225\353\240\254 \354\225\214\352\263\240\353\246\254\354\246\230/\355\236\231 \354\240\225\353\240\254.md" @@ -53,16 +53,6 @@ $O(1)$ 최악의 경우 ![힙 이미지](https://upload.wikimedia.org/wikipedia/commons/1/1b/Sorting_heapsort_anim.gif) -## 구현 - -- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp) -- [파이썬](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py) -- [루비](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/heap_sort.rb) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/HeapSorter.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort.c) -- [자바스크립트](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/HeapSort.js) - ## 영상 URL [힙 정렬 알고리즘에 대한 영상 설명](https://www.youtube.com/watch?v=MtQL_ll5KhQ) diff --git "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\230\225 \355\203\220\354\203\211.md" "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\230\225 \355\203\220\354\203\211.md" index 51c160b5..d024fdeb 100644 --- "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\230\225 \355\203\220\354\203\211.md" +++ "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\204\240\355\230\225 \355\203\220\354\203\211.md" @@ -44,11 +44,6 @@ target = 6 마지막 원소가 목표와 같지 않으므로 6이 배열에 들어있지 않다고 판단하여 -1을 반환한다. ``` -## 구현 - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/LinearSearch.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py) - ## 영상 URL - [CS50](https://www.youtube.com/watch?v=CX2CYIJLwfg) diff --git "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\235\264\354\247\204 \355\203\220\354\203\211.md" "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\235\264\354\247\204 \355\203\220\354\203\211.md" index 59f7dc29..9e378db2 100644 --- "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\235\264\354\247\204 \355\203\220\354\203\211.md" +++ "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\235\264\354\247\204 \355\203\220\354\203\211.md" @@ -53,14 +53,6 @@ arr = [7] 유일한 원소가 목표와 같지 않으므로 9가 배열에 들어있지 않다고 판단하여 -1을 반환한다. ``` -## 구현 - -- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp) -- [파이썬](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/BinarySearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/Binary_Search.c) - ## 영상 URL - [CS50: 이진 탐색](https://www.youtube.com/watch?v=5xlIPT1FRcA) diff --git "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\247\200\354\210\230 \355\203\220\354\203\211.md" "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\247\200\354\210\230 \355\203\220\354\203\211.md" index 779d51ea..ff42267a 100644 --- "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\247\200\354\210\230 \355\203\220\354\203\211.md" +++ "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\354\247\200\354\210\230 \355\203\220\354\203\211.md" @@ -55,8 +55,3 @@ target = 998 - 이진 탐색은 배열의 중간부터 시작하여 많은 반복문을 지나야 4번째 원소에 도착한다. - 지수 탐색은 2번 만에 4번째 원소에 도착한다. - -## 구현 - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/exponential_search.cpp) -- [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/ExponentialSearch.js) diff --git "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\355\224\214\353\241\234\354\235\264\353\223\234 \354\210\234\355\231\230 \355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230.md" "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\355\224\214\353\241\234\354\235\264\353\223\234 \354\210\234\355\231\230 \355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230.md" index 06c2738a..70162f38 100644 --- "a/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\355\224\214\353\241\234\354\235\264\353\223\234 \354\210\234\355\231\230 \355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230.md" +++ "b/ko/\355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230/\355\224\214\353\241\234\354\235\264\353\223\234 \354\210\234\355\231\230 \355\203\220\354\203\211 \354\225\214\352\263\240\353\246\254\354\246\230.md" @@ -29,11 +29,6 @@ arr = [3, 4, 8, 5, 9, 1, 2, 6, 7, 4] return value = 4 ``` -## 구현 - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/floyd_cycle_detection_algo.cpp) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/floyd_cycle_detection_algorithm.c) - ## 영상 URL - [플로이드 순환 탐색 알고리즘 유튜브 영상](https://www.youtube.com/watch?v=B6smdk7pZ14) diff --git a/pt-br/Algoritmos de Busca/Busca Binaria.md b/pt-br/Algoritmos de Busca/Busca Binaria.md index 5c08ec26..cd350166 100644 --- a/pt-br/Algoritmos de Busca/Busca Binaria.md +++ b/pt-br/Algoritmos de Busca/Busca Binaria.md @@ -40,14 +40,6 @@ alvo = 9 # A pesquisa binária deve retornar -1, pois 9 não está presente na matriz ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/BinarySearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/Binary_Search.c) - #### Explicação em vídeo [Um vídeo CS50 explicando o algoritmo de pesquisa binária](https://www.youtube.com/watch?v=5xlIPT1FRcA) diff --git a/pt-br/Algoritmos de Busca/Busca Linear.md b/pt-br/Algoritmos de Busca/Busca Linear.md index a918982d..5d6690e0 100644 --- a/pt-br/Algoritmos de Busca/Busca Linear.md +++ b/pt-br/Algoritmos de Busca/Busca Linear.md @@ -33,11 +33,6 @@ alvo = 6 # A pesquisa linear deve retornar -1, pois 6 não está presente na matriz ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py) - #### Explicação em vídeo [Um vídeo CS50 explicando o algoritmo de pesquisa linear](https://www.youtube.com/watch?v=CX2CYIJLwfg) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Bubble Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Bubble Sort.md" index 203a71b1..d4599dd9 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Bubble Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Bubble Sort.md" @@ -79,18 +79,6 @@ arr[] = {10, 30, 40, 80} Como não há trocas nas etapas acima, isso significa que a matriz está classificada e podemos parar por aqui. ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/bubblesort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/bubble_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/BubbleSort.scala) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/BubbleSort.js) - #### Explicação em vídeo [Um vídeo explicando o algoritmo de classificação por bolha](https://www.youtube.com/watch?v=Jdtq5uKz-w4) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Heap Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Heap Sort.md" index 2711232b..461cb947 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Heap Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Heap Sort.md" @@ -55,17 +55,6 @@ O procedimento heapify chama a si mesmo recursivamente para construir heap de ci ![heap-image](https://upload.wikimedia.org/wikipedia/commons/1/1b/Sorting_heapsort_anim.gif "Heap Sort") -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/heapsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/heap_sort.rb) -- [C-sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/HeapSorter.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort.c) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/master/Sorts/HeapSort.js) - #### Explicação em vídeo [Um vídeo explicando o algoritmo de classificação por seleção](https://www.youtube.com/watch?v=MtQL_ll5KhQ) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Insertion Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Insertion Sort.md" index 3ec6b5e1..4d85bda3 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Insertion Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Insertion Sort.md" @@ -46,16 +46,6 @@ e os elementos de 11 a 13 se moverão uma posição à frente de sua posição a 5, 6, 11, 12, 13 - matriz classificada ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/InsertionSort.java) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp) -- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/InsertionSort.scala) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/insertion_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/insertion_sort.rb) - #### Explicação em vídeo [Um vídeo CS50 explicando o algoritmo de pesquisa de inserção](https://www.youtube.com/watch?v=DFG-XuyPYUQ) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Merge Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Merge Sort.md" index bdd774f0..a29a4285 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Merge Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Merge Sort.md" @@ -31,12 +31,6 @@ Chame recursivamente a função merge sort para ambas as metades, o que fornecer Agora mescle as duas metades para obter a matriz classificada [0, 1, 2, 3, 5, 9] ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb) - #### Explicação em vídeo [Um vídeo CS50 explicando o algoritmo de classificação de mesclagem](https://www.youtube.com/watch?v=EeQ8pwjQxTM) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Quick Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Quick Sort.md" index 2d2c9af6..765d5a27 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Quick Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Quick Sort.md" @@ -67,13 +67,6 @@ Agora, 70 está em seu lugar correto. Todos os elementos menores que isto. ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/QuickSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Quick%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb) - #### Explicação em vídeo [Um vídeo explicando o algoritmo de classificação rápida](https://www.youtube.com/watch?v=COk73cpQbFQ) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Selection Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Selection Sort.md" index 939366d8..575bbc7d 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Selection Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Selection Sort.md" @@ -47,17 +47,6 @@ Selecione o número mínimo da matriz (entre o índice 2-3), ou seja, 40 A matriz agora está classificada. ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Selection%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/selectionsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/selection_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/SelectionSort.c) -- [Scala](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/SelectionSort.js) - #### Explicação em vídeo [Um vídeo explicando o algoritmo de classificação por seleção](https://www.youtube.com/watch?v=f8hXR_Hvybo) diff --git "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Shell Sort.md" "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Shell Sort.md" index 98696eef..535e7ecf 100644 --- "a/pt-br/Algoritmos de Ordena\303\247\303\243o/Shell Sort.md" +++ "b/pt-br/Algoritmos de Ordena\303\247\303\243o/Shell Sort.md" @@ -52,17 +52,6 @@ Lacuna inicial: 4 12. Divida a lacuna por 2 e repita até lacuna = 1 ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/ShellSort.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Shell%20Sort.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/ShellSorter.cs) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/sort/shellsort.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/Sorting/shell_sort.rb) -- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/shellSort.c) -- [Javascript](https://github.com/TheAlgorithms/JavaScript/blob/master/Sorts/ShellSort.js) - #### Explicação em vídeo [Um vídeo explicando o algoritmo de classificação Shell](https://www.youtube.com/watch?v=H8NiFkGu2PY) diff --git a/pt-br/Estruturas de Dados/Graph/Bellman-Ford.md b/pt-br/Estruturas de Dados/Graph/Bellman-Ford.md index 52a31bd2..14beb730 100644 --- a/pt-br/Estruturas de Dados/Graph/Bellman-Ford.md +++ b/pt-br/Estruturas de Dados/Graph/Bellman-Ford.md @@ -86,13 +86,6 @@ D -2 A-> B-> E-> D = -1 + 2 + -3 E 1 A-> B-> E = -1 + 2 ``` -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/bellman_ford.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py) -- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bellman_ford.c) - #### Explicação em vídeo [Um vídeo explicando o Algoritmo Bellman-Ford](https://www.youtube.com/watch?v=hxMWBBCpR6A) diff --git a/pt-br/Estruturas de Dados/Linked Lists/Lista Duplamente Vinculada.md b/pt-br/Estruturas de Dados/Linked Lists/Lista Duplamente Vinculada.md index b17cfc55..dc09750d 100644 --- a/pt-br/Estruturas de Dados/Linked Lists/Lista Duplamente Vinculada.md +++ b/pt-br/Estruturas de Dados/Linked Lists/Lista Duplamente Vinculada.md @@ -102,14 +102,6 @@ comprimento interno; // opcional ! [Rastreamento de algoritmo](https://www.geeksforgeeks.org/wp-content/uploads/gq/2014/03/DLL_add_middle1.png) -## Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py) -- [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go) -- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/double_list.rb) - ## Explicação em vídeo [Um vídeo CS50 explicando a estrutura de dados da lista duplamente vinculada](https://www.youtube.com/watch?v=FHMPswJDCvU) diff --git a/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md b/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md index ec7d3f74..d66044aa 100644 --- a/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md +++ b/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md @@ -37,12 +37,6 @@ class LinkedList { } ``` -## Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py) - ## Explicação em vídeo [Um vídeo CS50 explicando a estrutura de dados da lista vinculada](https://www.youtube.com/watch?v=5nsKtQuT6E8) diff --git "a/pt-br/Matem\303\241tica B\303\241sica/M\303\251dia.md" "b/pt-br/Matem\303\241tica B\303\241sica/M\303\251dia.md" index 5ba6f38c..a6b173d0 100644 --- "a/pt-br/Matem\303\241tica B\303\241sica/M\303\251dia.md" +++ "b/pt-br/Matem\303\241tica B\303\241sica/M\303\251dia.md" @@ -58,10 +58,6 @@ Se considerarmos corretamente os dígitos significativos: `soma / contagem = 23` Retorne o valor de 22 ou `23`. -## Implementação - -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/average_mean.py) - ## URL do vídeo - [Média na Khan Academy](https://www.khanacademy.org/math/ap-statistics/summarizing-quantitative-data-ap/measuring-center-quantitative/v/mean-median-and-mode) diff --git "a/pt-br/Programa\303\247\303\243o Din\303\242mica/Subsequencia Maxima - Maior Subsequencia Comum (LCS).md" "b/pt-br/Programa\303\247\303\243o Din\303\242mica/Subsequencia Maxima - Maior Subsequencia Comum (LCS).md" index 554c3b56..c2175d3f 100644 --- "a/pt-br/Programa\303\247\303\243o Din\303\242mica/Subsequencia Maxima - Maior Subsequencia Comum (LCS).md" +++ "b/pt-br/Programa\303\247\303\243o Din\303\242mica/Subsequencia Maxima - Maior Subsequencia Comum (LCS).md" @@ -79,12 +79,6 @@ B 0 0 1 2 3 Sendo o comprimento da maior subsequência comum igual a: `dp[4][4] = 3`. -#### Links de implementação de código - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Longest%20Common%20Subsequence.cpp) - #### Explicação em vídeo - [Vídeo do canal OnlineBioinfo Bioinformática explicando sobre o algoritmo LCS](https://youtu.be/cX_hFqA8wDI) diff --git "a/pt-br/Programa\303\247\303\243o Din\303\242mica/Trocando moedas.md" "b/pt-br/Programa\303\247\303\243o Din\303\242mica/Trocando moedas.md" index 5144bdd5..763ee879 100644 --- "a/pt-br/Programa\303\247\303\243o Din\303\242mica/Trocando moedas.md" +++ "b/pt-br/Programa\303\247\303\243o Din\303\242mica/Trocando moedas.md" @@ -57,10 +57,6 @@ Digamos que temos 3 tipos de moeda `[1,2,3]` e queremos mudar para `7` centavos. Portanto, a resposta final é **8**. 8 maneiras de fazer troco de 7 centavos usando todos os tipos de moedas. `{{1,1,1,1,1,1,1}, {1,1,1,1,1,2}, {1,1,1,2,2}, {1,2,2,2}, {1,1,1,1,3}, {1,3,3}, {2,2,3}, {1,1,2,3}}` -#### Link de implementação de código - -[Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/coin_change.py) - #### Explicação em vídeo [Total de maneiras exclusivas de fazer a mudança em back to back SWE](https://www.youtube.com/watch?v=DJ4a7cmjZY0) diff --git "a/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\237\320\276\320\270\321\201\320\272\320\260/\320\221\320\270\320\275\320\260\321\200\320\275\321\213\320\271 \320\237\320\276\320\270\321\201\320\272.md" "b/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\237\320\276\320\270\321\201\320\272\320\260/\320\221\320\270\320\275\320\260\321\200\320\275\321\213\320\271 \320\237\320\276\320\270\321\201\320\272.md" index a30caf0a..a35ed96c 100644 --- "a/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\237\320\276\320\270\321\201\320\272\320\260/\320\221\320\270\320\275\320\260\321\200\320\275\321\213\320\271 \320\237\320\276\320\270\321\201\320\272.md" +++ "b/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\237\320\276\320\270\321\201\320\272\320\260/\320\221\320\270\320\275\320\260\321\200\320\275\321\213\320\271 \320\237\320\276\320\270\321\201\320\272.md" @@ -40,14 +40,6 @@ target = 2 target = 9 ``` -#### Ссылки на реализации алгоритма - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java) -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py) -- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Search/BinarySearcher.cs) -- [C](https://github.com/TheAlgorithms/C/blob/master/searching/binary_search.c) - #### Видео обзоры #### Визуальное представление diff --git "a/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\241\320\276\321\200\321\202\320\270\321\200\320\276\320\262\320\272\320\270/\320\244\320\273\320\260\320\263 \320\235\320\270\320\264\320\265\321\200\320\273\320\260\320\275\320\264\320\276\320\262.md" "b/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\241\320\276\321\200\321\202\320\270\321\200\320\276\320\262\320\272\320\270/\320\244\320\273\320\260\320\263 \320\235\320\270\320\264\320\265\321\200\320\273\320\260\320\275\320\264\320\276\320\262.md" index a14615a7..93fa214e 100644 --- "a/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\241\320\276\321\200\321\202\320\270\321\200\320\276\320\262\320\272\320\270/\320\244\320\273\320\260\320\263 \320\235\320\270\320\264\320\265\321\200\320\273\320\260\320\275\320\264\320\276\320\262.md" +++ "b/ru/\320\220\320\273\320\263\320\276\321\200\320\270\321\202\320\274\321\213 \320\241\320\276\321\200\321\202\320\270\321\200\320\276\320\262\320\272\320\270/\320\244\320\273\320\260\320\263 \320\235\320\270\320\264\320\265\321\200\320\273\320\260\320\275\320\264\320\276\320\262.md" @@ -32,8 +32,3 @@ nums = [2, 0, 2, 1, 1, 0] print(dutch_flag_sort(nums)) # Output: [0, 0, 1, 1, 2, 2] ``` - -#### Ссылки на реализации алгоритма - -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/DutchNationalFlagSort.java) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/dutch_national_flag_sort.py) diff --git a/uz/Boshlang'ich Matematika/Fibonachi sonlari.md b/uz/Boshlang'ich Matematika/Fibonachi sonlari.md index 30ab542b..c65daca2 100644 --- a/uz/Boshlang'ich Matematika/Fibonachi sonlari.md +++ b/uz/Boshlang'ich Matematika/Fibonachi sonlari.md @@ -38,13 +38,6 @@ Fibonachi sonlarning 8chi hadini topishni ko'rib chiqamiz: f(8)=21 -## Fibonachi algoritmning dasturlash tillaridagi ko'rinishi: - -- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp) -- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/FibonacciNumber.java) -- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js) -- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py) - ## Video bog'ich - [YouTube](https://youtu.be/FQiRf4jb3PU)