docs(en): enhancement the linear search (#1096)

I noticed the steps in the algorithm to be continuous which would make it inconvenient for the reader. So, I reformatted the steps to look much cleaner and readable.

docs/en/Searching/Linear-Search.md

@@ -11,12 +11,19 @@ Linear search is usually very **simple to implement**.
 **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 8: Exit
 
 ## Pseudocode