From 3f6047c96d19f82c8e1c7d6921b958b6c2707df2 Mon Sep 17 00:00:00 2001
From: Akash <64220033+akash-arelli@users.noreply.github.com>
Date: Wed, 1 Jul 2020 20:53:08 +0530
Subject: [PATCH] Update is_sorted_until.md
---
algorithm/is_sorted_until.md | 3 ++-
1 file changed, 2 insertions(+), 1 deletion(-)
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 @@
Description: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.
Example:
+
,,,c+
#include
#include
@@ -20,7 +21,7 @@
<< "the list and the first unsorted element is " << *ip;
return 0;
}
-,,,
+ ,,,