docs: remove implementation sections

Author: vil02

en/Basic Math/Average_Mean.md

@@ -57,11 +57,6 @@ If we properly consider significant digits: `sum / count = 23`
 
 Return the value of 22.<u>857142</u> 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)

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)

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/)

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)
-

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)

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)

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)

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)

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)

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)