diff --git a/docs/en/Searching/Linear-Search.md b/docs/en/Searching/Linear-Search.md
index 1d4487ad..26975c3c 100644
--- a/docs/en/Searching/Linear-Search.md
+++ b/docs/en/Searching/Linear-Search.md
@@ -10,13 +10,20 @@ Linear search is usually very **simple to implement**.
 ## Steps/Algorithm: 
 **Linear Search( Array A, Value x)**
 
-Step 1: Set i to 1
-Step 2: if i > n then go to step 7
-Step 3: if A[i] = x then go to step 6
-Step 4: Set i to i + 1
-Step 5: Go to Step 2
-Step 6: Print Element x Found at index i and go to step 8
-Step 7: Print element not found
+Step 1: Set i to 1  
+
+Step 2: if i > n then go to step 7  
+
+Step 3: if A[i] = x then go to step 6  
+
+Step 4: Set i to i + 1  
+
+Step 5: Go to Step 2  
+
+Step 6: Print Element x Found at index i and go to step 8  
+
+Step 7: Print element not found  
+
 Step 8: Exit
 
 ## Pseudocode