diff --git a/guide/english/algorithms/search-algorithms/jump-search/index.md b/guide/english/algorithms/search-algorithms/jump-search/index.md
index 580dc120cf..b3f8a27822 100644
--- a/guide/english/algorithms/search-algorithms/jump-search/index.md
+++ b/guide/english/algorithms/search-algorithms/jump-search/index.md
@@ -3,6 +3,7 @@ title: Jump Search
 ---
 
 ## Jump Search
+
 A jump search locates an item in a sorted array by jumping k items in the array and then verifies if the item wanted is between the previous jump and current jump.
 
 # Worst Case Complexity
@@ -19,7 +20,7 @@ O(√N)
 # Code 
 To view examples of code implementation for this method, access this link below:
 
-[Jump Search - OpenGenus/cosmos](https://github.com/OpenGenus/cosmos/tree/master/code/search/jump_search)
+[Jump Search - OpenGenus/cosmos](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/jump_search)
 
 # Credits