We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6a76f9f commit b968549Copy full SHA for b968549
sorting/quick_sort_iterative.cpp
@@ -10,11 +10,11 @@
10
* @author Sebe324 (https://github.com/sebe324)
11
*/
12
13
-#include <iostream> //for std::cout
14
-#include <vector> //for std::vector
15
-#include <stack> //for std::stack
16
-#include <algorithm> //for std::is_sorted
17
-#include <cassert> //for assert
+#include <iostream> /// for std::cout
+#include <vector> /// for std::vector
+#include <stack> /// for std::stack
+#include <algorithm> ///for std::is_sorted
+#include <cassert> /// for assert
18
19
/**
20
* @brief The partition function sorts the array from
0 commit comments