chore: add url_check.yml (#231)

* chore: add `url_check.yml` * docs: remove some broken links * chore: do not fail when broken links found
TheAlgorithms · Apr 4, 2024 · fe77013 · fe77013
1 parent 4d500fd
commit fe77013
Show file tree

Hide file tree

Showing 18 changed files with 28 additions and 29 deletions.
diff --git a/.github/workflows/url_check.yml b/.github/workflows/url_check.yml
@@ -0,0 +1,28 @@
+---
+name: url_check
+
+'on':
+  workflow_dispatch:
+  push:
+    branches:
+      - master
+  pull_request:
+  schedule:
+    - cron: '43 5 * * TUE'
+
+jobs:
+  run_lychee:
+    runs-on: ubuntu-latest
+
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v4
+
+      - name: Check links
+        uses: lycheeverse/[email protected]
+        with:
+          args: >
+            --no-progress
+            *
+          fail: false
+...
diff --git a/en/Basic Math/Fibonacci_Numbers.md b/en/Basic Math/Fibonacci_Numbers.md
@@ -57,17 +57,14 @@ F(8)=21
 
 ## Implementation
 
-- [C](https://github.com/TheAlgorithms/C/blob/master/misc/fibonacci.c)
 - [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)
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/FibonacciNumber.java)
 - [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)
-- [R](https://github.com/TheAlgorithms/R/blob/master/Mathematics/Fibonacci.R)
 - [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)

diff --git a/en/Basic Math/Geometric Pogression.md b/en/Basic Math/Geometric Pogression.md
@@ -51,4 +51,3 @@ nth term of a GP = `a*rn-1`.
 # YouTube
 
 - [Video URL for concept](https://youtu.be/gua96ju_FBk)
-- [Video for understanding GP Dynamic Programming in C++](https://youtu.be/92ZldzuGUHs)
diff --git a/en/Data Structures/Linked Lists/Singly Linked List.md b/en/Data Structures/Linked Lists/Singly Linked List.md
@@ -42,7 +42,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_structures/linked_list.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py)
-- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)
 
 ## Video Explanation
 

diff --git a/en/Sorting Algorithms/Merge Sort.md b/en/Sorting Algorithms/Merge Sort.md
@@ -62,8 +62,6 @@ At the next stack level [1, 2, 5, 9] and [3, 4, 6, 7] will be merged and we will
 #### Code Implementation Links
 
 - [Assembly](https://github.com/TheAlgorithms/AArch64_Assembly/blob/main/sorters/merge_sort.s)
-- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c)
-- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)
 - [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)
@@ -78,7 +76,6 @@ At the next stack level [1, 2, 5, 9] and [3, 4, 6, 7] will be merged and we will
 - [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)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 - [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)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento de fusión.md b/es/Algoritmos de Ordenamiento/Ordenamiento de fusión.md
@@ -35,9 +35,6 @@ Ahora combine ambas mitades para obtener la matriz ordenada [0, 1, 2, 3, 5, 9]
 
 - [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)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
-- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)
-- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb)
 
 #### Explicación de vídeo

diff --git a/es/Algoritmos de búsqueda/Búsqueda lineal.md b/es/Algoritmos de búsqueda/Búsqueda lineal.md
@@ -36,7 +36,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)
-- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Linear%20Search.cpp)
 - [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)

diff --git a/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md b/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md
@@ -42,7 +42,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)
-- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)
 
 ## Explicación de vídeo
 

diff --git a/fr/tri/Tri_fusion.md b/fr/tri/Tri_fusion.md
@@ -49,11 +49,8 @@ Au niveau suivant de la pile, [1, 2, 5, 9] et [3, 4, 6, 7] seront fusionnés et
 
 ## Implémentation
 
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 - [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java)
-- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp)
-- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)
 - [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)
diff --git a/he/מתמטיקה בסיסית/מספרי פיבונאצ'י.md b/he/מתמטיקה בסיסית/מספרי פיבונאצ'י.md
@@ -82,7 +82,6 @@ F(8)=21
 <h2 dir="rtl" text-align="center"> יישום סדרת פיבונאצ'י בשפות תכנות שונות</h2>
 
 - [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)
 

diff --git a/ko/기초 수학/등비수열.md b/ko/기초 수학/등비수열.md
@@ -46,7 +46,6 @@
 ## 영상 URL
 
 - [Don't Memorise](https://youtu.be/gua96ju_FBk)
-- [Code Bashers (C++)](https://youtu.be/92ZldzuGUHs)
 
 ## 출처
 

diff --git a/ko/자료구조/연결 리스트/단일 연결 리스트.md b/ko/자료구조/연결 리스트/단일 연결 리스트.md
@@ -43,7 +43,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)
-- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)
 
 ## 영상 URL
 

diff --git a/ko/정렬 알고리즘/병합 정렬.md b/ko/정렬 알고리즘/병합 정렬.md
@@ -35,9 +35,6 @@ 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)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
-- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)
-- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb)
 
 ## 영상 URL

diff --git a/ko/정렬 알고리즘/힙 정렬.md b/ko/정렬 알고리즘/힙 정렬.md
@@ -58,7 +58,6 @@ $O(1)$ 최악의 경우
 - [자바](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/Go/blob/master/sorts/heapsort.go)
 - [루비](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)

diff --git a/ko/탐색 알고리즘/선형 탐색.md b/ko/탐색 알고리즘/선형 탐색.md
@@ -47,7 +47,6 @@ target = 6
 ## 구현
 
 - [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/LinearSearch.java)
-- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Linear%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
 
 ## 영상 URL

diff --git a/pt-br/Algoritmos de Busca/Busca Linear.md b/pt-br/Algoritmos de Busca/Busca Linear.md
@@ -36,7 +36,6 @@ alvo = 6
 #### Links de implementação de código
 
 - [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%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
 
 #### Explicação em vídeo

diff --git a/pt-br/Algoritmos de Ordenação/Merge Sort.md b/pt-br/Algoritmos de Ordenação/Merge Sort.md
@@ -35,9 +35,6 @@ Agora mescle as duas metades para obter a matriz classificada [0, 1, 2, 3, 5, 9]
 
 - [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)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
-- [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)
-- [C](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/merge_sort.rb)
 
 #### Explicação em vídeo

diff --git a/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md b/pt-br/Estruturas de Dados/Linked Lists/Lista individual.md
@@ -42,7 +42,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)
-- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)
 
 ## Explicação em vídeo
Original file line number	Diff line number	Diff line change
Expand Up		@@ -51,4 +51,3 @@ nth term of a GP = `a*rn-1`.
		# YouTube

		- [Video URL for concept](https://youtu.be/gua96ju_FBk)
		- [Video for understanding GP Dynamic Programming in C++](https://youtu.be/92ZldzuGUHs)