Indentations improved

mohitkyadav · mohitkyadav · commit aa72edc515ec · 2017-06-23T15:56:31.000+05:30
diff --git a/README.md b/README.md
@@ -1,5 +0,0 @@
-# Amazing-STL-Algoritms
-<h1 style="font-style: italic;">C++ is all about control</h1>
-<blockquote>
-Algorithms are beautifull
-</blockquote>
diff --git a/accumulate.cpp b/accumulate.cpp
@@ -6,11 +6,11 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };
-    int total = accumulate(begin(v), end(v), 0);
-    cout << total << endl;
-    total = accumulate(begin(v), end(v), 0,
-        [](int total, int i) {if(i % 2 == 0) return total + i; return total;});
-    cout << total;
-    return 0;
+	vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };
+	int total = accumulate(begin(v), end(v), 0);
+	cout << total << endl;
+	total = accumulate(begin(v), end(v), 0,
+		[](int total, int i) {if(i % 2 == 0) return total + i; return total;});
+	cout << total;
+	return 0;
 }
diff --git a/adjacent_find.cpp b/adjacent_find.cpp
@@ -6,10 +6,10 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, 2, 4, 0 };
-    auto result = adjacent_find(begin(v), end(v));
-    cout << *result << endl;
-    advance(result, 3);
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, 2, 4, 0 };
+	auto result = adjacent_find(begin(v), end(v));
+	cout << *result << endl;
+	advance(result, 3);
+	cout << *result << endl;
+	return 0;
 }
diff --git a/all_of.cpp b/all_of.cpp
@@ -6,8 +6,8 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    bool result = all_of(begin(v), end(v), [](auto elem) {return elem > -4;});
-    cout << result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	bool result = all_of(begin(v), end(v), [](auto elem) {return elem > -4;});
+	cout << result << endl;
+	return 0;
 }
diff --git a/any_of.cpp b/any_of.cpp
@@ -6,8 +6,8 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    bool result = any_of(begin(v), end(v), [](auto elem) {return elem > -4;});
-    cout << result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	bool result = any_of(begin(v), end(v), [](auto elem) {return elem > -4;});
+	cout << result << endl;
+	return 0;
 }
diff --git a/copy.cpp b/copy.cpp
@@ -10,8 +10,8 @@ int main()
 	vector<int> v(source.size());
 	copy(begin(source), end(source), begin(v));
 	for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
+	{
+		cout << elem << " ";
+	}
 	return 0;
 }
diff --git a/copy_backward.cpp b/copy_backward.cpp
@@ -10,8 +10,8 @@ int main()
 	vector<int> v(source.size());
 	copy_backward(begin(source), end(source), end(v));
 	for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
+	{
+		cout << elem << " ";
+	}
 	return 0;
 }
diff --git a/copy_if.cpp b/copy_if.cpp
@@ -6,12 +6,12 @@ using namespace std;
 
 int main()
 {
-    vector<int> source{ 4, 3, 2, 0, 15, 2, 100, -5, 1000 };
+	vector<int> source{ 4, 3, 2, 0, 15, 2, 100, -5, 1000 };
 	vector<int> v(source.size());
 	copy_if(begin(source), end(source), begin(v), [](int elem) {return elem % 2 == 0;});
 	for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
+	{
+		cout << elem << " ";
+	}
 	return 0;
 }
diff --git a/copy_n.cpp b/copy_n.cpp
@@ -6,13 +6,13 @@ using namespace std;
 
 int main()
 {
-    vector<int> source{ 4, 3, 2, 0, 15, 2, 100, -5, 1000 };
+	vector<int> source{ 4, 3, 2, 0, 15, 2, 100, -5, 1000 };
 	vector<int> v(source.size());
 	int req = 4;
 	copy_n(begin(source), req, begin(v));
 	for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
+	{
+		cout << elem << " ";
+	}
 	return 0;
 }
diff --git a/count.cpp b/count.cpp
@@ -6,11 +6,11 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int target = v[0];
-    int result = count(begin(v), end(v), target);
-    //or
-    //int result = count(v.begin(), v.end(), target);
-    cout << result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int target = v[0];
+	int result = count(begin(v), end(v), target);
+	//or
+	//int result = count(v.begin(), v.end(), target);
+	cout << result << endl;
+	return 0;
 }
diff --git a/count_if.cpp b/count_if.cpp
@@ -6,8 +6,8 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int result = count_if(begin(v), end(v), [](auto elem) { return elem > 0;});
-    cout << result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int result = count_if(begin(v), end(v), [](auto elem) { return elem > 0;});
+	cout << result << endl;
+	return 0;
 }
diff --git a/equal.cpp b/equal.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };
-    vector<int> v2{ 1, 23, 45, 1, 2, 4, 0 };
-    bool same = equal(begin(v1), end(v1), begin(v2), end(v2));
-    cout << same << endl;
-    return 0;
+	vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };
+	vector<int> v2{ 1, 23, 45, 1, 2, 4, 0 };
+	bool same = equal(begin(v1), end(v1), begin(v2), end(v2));
+	cout << same << endl;
+	return 0;
 }
diff --git a/find.cpp b/find.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int target = v[5];
-    auto result = find(begin(v), end(v), target);
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int target = v[5];
+	auto result = find(begin(v), end(v), target);
+	cout << *result << endl;
+	return 0;
 }
diff --git a/find_end.cpp b/find_end.cpp
@@ -6,13 +6,13 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    vector<int> subVec{ -2, 4 };
-    auto result = find_end(begin(v), end(v), begin(subVec), end(subVec));
-    // first element of subVec
-    cout << *result << endl;
-    advance(result, 1);
-    // last element of subVec
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	vector<int> subVec{ -2, 4 };
+	auto result = find_end(begin(v), end(v), begin(subVec), end(subVec));
+	// first element of subVec
+	cout << *result << endl;
+	advance(result, 1);
+	// last element of subVec
+	cout << *result << endl;
+	return 0;
 }
diff --git a/find_first_of.cpp b/find_first_of.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    vector<int> primes{ 3, 5, 7 };
-    auto result = find_first_of(begin(v), end(v), begin(primes), end(primes));
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	vector<int> primes{ 3, 5, 7 };
+	auto result = find_first_of(begin(v), end(v), begin(primes), end(primes));
+	cout << *result << endl;
+	return 0;
 }
diff --git a/find_if.cpp b/find_if.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int target = v[0];
-    auto result = find_if(begin(v), end(v), [target](auto elem) {return elem == target;} );
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int target = v[0];
+	auto result = find_if(begin(v), end(v), [target](auto elem) {return elem == target;} );
+	cout << *result << endl;
+	return 0;
 }
diff --git a/find_if_not.cpp b/find_if_not.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int target = v[0];
-    auto result = find_if_not(begin(v), end(v), [target](auto elem) {return elem == target;} );
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int target = v[0];
+	auto result = find_if_not(begin(v), end(v), [target](auto elem) {return elem == target;} );
+	cout << *result << endl;
+	return 0;
 }
diff --git a/for_each.cpp b/for_each.cpp
@@ -6,9 +6,9 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };
-    for_each(begin(v), end(v), [](int& elem) {return elem = 1;});
-    int total = accumulate(begin(v), end(v), 0);
-    cout << total;
-    return 0;
+	vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };
+	for_each(begin(v), end(v), [](int& elem) {return elem = 1;});
+	int total = accumulate(begin(v), end(v), 0);
+	cout << total;
+	return 0;
 }
diff --git a/is_sorted_until.cpp b/is_sorted_until.cpp
@@ -6,8 +6,8 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 3, 4, -5, 6, 17 };
-    auto result = is_sorted_until(begin(v), begin(v) + 2);
+	vector<int> v{ 2, 3, 4, -5, 6, 17 };
+	auto result = is_sorted_until(begin(v), begin(v) + 2);
 	cout << *result;
 	return 0;
 }
diff --git a/mismatch.cpp b/mismatch.cpp
@@ -6,10 +6,10 @@ using namespace std;
 
 int main()
 {
-    vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };
-    vector<int> v2{ 2, 7, 2, 2, -2, 4, 0 };
-    auto diff = mismatch(begin(v1), end(v1), begin(v2));
-    cout << *diff.first << endl;
-    cout << *diff.second << endl;
-    return 0;
+	vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };
+	vector<int> v2{ 2, 7, 2, 2, -2, 4, 0 };
+	auto diff = mismatch(begin(v1), end(v1), begin(v2));
+	cout << *diff.first << endl;
+	cout << *diff.second << endl;
+	return 0;
 }
diff --git a/none_of.cpp b/none_of.cpp
@@ -6,8 +6,8 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    bool result = none_of(begin(v), end(v), [](auto elem) {return elem > -4;});
-    cout << result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	bool result = none_of(begin(v), end(v), [](auto elem) {return elem > -4;});
+	cout << result << endl;
+	return 0;
 }
diff --git a/nth_element.cpp b/nth_element.cpp
@@ -9,8 +9,8 @@ int main()
 	vector<int> v{ 4, 3, 2, 0, 15, 2, 100, -5, 1000 };
 	nth_element(begin(v), begin(v) + 6, end(v));
 	for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
+	{
+		cout << elem << " ";
+	}
 	return 0;
 }
diff --git a/partial_sort.cpp b/partial_sort.cpp
@@ -6,12 +6,12 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 45, 2, 3, 4, -5, 6, 17 };
-    int target = v[3];
+	vector<int> v{ 45, 2, 3, 4, -5, 6, 17 };
+	int target = v[3];
 	partial_sort(begin(v), find(begin(v), end(v), target), end(v));
 	for(auto elem : v)
 	{
-	    cout << elem << " ";
+		cout << elem << " ";
 	}
 	return 0;
 }
diff --git a/partial_sort_copy.cpp b/partial_sort_copy.cpp
@@ -6,11 +6,11 @@ using namespace std;
 
 void print(vector<int> v)
 {
-    for(auto elem : v)
-    {
-        cout << elem << " ";
-    }
-    cout << "\n";
+	for(auto elem : v)
+	{
+		cout << elem << " ";
+	}
+	cout << "\n";
 }
 
 int main()
diff --git a/search.cpp b/search.cpp
@@ -6,13 +6,13 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    vector<int> subVec{ 2, -2, 4, 0 };
-    auto result = search(begin(v), end(v), begin(subVec), end(subVec));
-    // first element of subVec
-    cout << *result << endl;
-    advance(result, 3);
-    // last element of subVec
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	vector<int> subVec{ 2, -2, 4, 0 };
+	auto result = search(begin(v), end(v), begin(subVec), end(subVec));
+	// first element of subVec
+	cout << *result << endl;
+	advance(result, 3);
+	// last element of subVec
+	cout << *result << endl;
+	return 0;
 }
diff --git a/search_n.cpp b/search_n.cpp
@@ -6,10 +6,10 @@ using namespace std;
 
 int main()
 {
-    vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
-    int target = v[5];
-    int repeat = 1;
-    auto result = search_n(begin(v), end(v), repeat, target);
-    cout << *result << endl;
-    return 0;
+	vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };
+	int target = v[5];
+	int repeat = 1;
+	auto result = search_n(begin(v), end(v), repeat, target);
+	cout << *result << endl;
+	return 0;
 }
diff --git a/shuffle.cpp b/shuffle.cpp

Original file line number	Diff line number	Diff line change
`@@ -6,8 +6,8 @@ using namespace std;`
`6`	`6`
`7`	`7`	`int main()`
`8`	`8`	`{`
`9`		`- vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };`
`10`		`- bool result = all_of(begin(v), end(v), [](auto elem) {return elem > -4;});`
`11`		`- cout << result << endl;`
`12`		`- return 0;`
	`9`	`+ vector<int> v{ 2, 7, 1, 2, -2, 4, 0 };`
	`10`	`+ bool result = all_of(begin(v), end(v), [](auto elem) {return elem > -4;});`
	`11`	`+ cout << result << endl;`
	`12`	`+ return 0;`
`13`	`13`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,9 +6,9 @@ using namespace std;`
`6`	`6`
`7`	`7`	`int main()`
`8`	`8`	`{`
`9`		`- vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };`
`10`		`- vector<int> v2{ 1, 23, 45, 1, 2, 4, 0 };`
`11`		`- bool same = equal(begin(v1), end(v1), begin(v2), end(v2));`
`12`		`- cout << same << endl;`
`13`		`- return 0;`
	`9`	`+ vector<int> v1{ 2, 7, 1, 2, -2, 4, 0 };`
	`10`	`+ vector<int> v2{ 1, 23, 45, 1, 2, 4, 0 };`
	`11`	`+ bool same = equal(begin(v1), end(v1), begin(v2), end(v2));`
	`12`	`+ cout << same << endl;`
	`13`	`+ return 0;`
`14`	`14`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,9 +6,9 @@ using namespace std;`
`6`	`6`
`7`	`7`	`int main()`
`8`	`8`	`{`
`9`		`- vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };`
`10`		`- for_each(begin(v), end(v), [](int& elem) {return elem = 1;});`
`11`		`- int total = accumulate(begin(v), end(v), 0);`
`12`		`- cout << total;`
`13`		`- return 0;`
	`9`	`+ vector<int> v{ 2, 7, 2, 2, -2, 4, 0 };`
	`10`	`+ for_each(begin(v), end(v), [](int& elem) {return elem = 1;});`
	`11`	`+ int total = accumulate(begin(v), end(v), 0);`
	`12`	`+ cout << total;`
	`13`	`+ return 0;`
`14`	`14`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,8 +6,8 @@ using namespace std;`
`6`	`6`
`7`	`7`	`int main()`
`8`	`8`	`{`
`9`		`- vector<int> v{ 2, 3, 4, -5, 6, 17 };`
`10`		`- auto result = is_sorted_until(begin(v), begin(v) + 2);`
	`9`	`+ vector<int> v{ 2, 3, 4, -5, 6, 17 };`
	`10`	`+ auto result = is_sorted_until(begin(v), begin(v) + 2);`
`11`	`11`	`cout << *result;`
`12`	`12`	`return 0;`
`13`	`13`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,12 +6,12 @@ using namespace std;`
`6`	`6`
`7`	`7`	`int main()`
`8`	`8`	`{`
`9`		`- vector<int> v{ 45, 2, 3, 4, -5, 6, 17 };`
`10`		`- int target = v[3];`
	`9`	`+ vector<int> v{ 45, 2, 3, 4, -5, 6, 17 };`
	`10`	`+ int target = v[3];`
`11`	`11`	`partial_sort(begin(v), find(begin(v), end(v), target), end(v));`
`12`	`12`	`for(auto elem : v)`
`13`	`13`	`{`
`14`		`- cout << elem << " ";`
	`14`	`+ cout << elem << " ";`
`15`	`15`	`}`
`16`	`16`	`return 0;`
`17`	`17`	`}`