diff --git a/algorithm/is_sorted_until.md b/algorithm/is_sorted_until.md
index 8ded4e7e..930bcb6e 100644
--- a/algorithm/is_sorted_until.md
+++ b/algorithm/is_sorted_until.md
@@ -2,6 +2,7 @@
 <p><strong>Description:</strong>std::is_sorted_until is used to find out the first unsorted element in the range [first, last). It returns an iterator to the first unsorted element in the range, so all the elements in between first and the iterator returned are sorted.</p>
 
 <h6>Example:</h6>
+         
          ,,,c+ 
           #include <iostream> 
          #include <algorithm> 
@@ -20,7 +21,7 @@
          << "the list and the first unsorted element is " << *ip; 
              return 0; 
      } 
-,,,
+     ,,,
 
 <br>
 <h3><a href="https://rextester.com/NLRDYA45690">RUN CODE</a><h3>