backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
sorting/slow_sort.cpp
View File

@@ -10,8 +10,7 @@
#include <iostream>
void SlowSort(int a[], int i, int j)
{
void SlowSort(int a[], int i, int j) {
if (i >= j)
return;
int m = i + (j - i) / 2; // midpoint, implemented this way to avoid
@@ -19,8 +18,7 @@ void SlowSort(int a[], int i, int j)
int temp;
SlowSort(a, i, m);
SlowSort(a, m + 1, j);
if (a[j] < a[m])
{
if (a[j] < a[m]) {
temp = a[j]; // swapping a[j] & a[m]
a[j] = a[m];
a[m] = temp;
@@ -30,8 +28,7 @@ void SlowSort(int a[], int i, int j)
// Sample Main function
int main()
{
int main() {
int size;
std::cout << "\nEnter the number of elements : ";
@@ -41,8 +38,7 @@ int main()
std::cout << "\nEnter the unsorted elements : ";
for (int i = 0; i < size; ++i)
{
for (int i = 0; i < size; ++i) {
std::cout << "\n";
std::cin >> arr[i];
}
@@ -51,8 +47,7 @@ int main()
std::cout << "Sorted array\n";
for (int i = 0; i < size; ++i)
{
for (int i = 0; i < size; ++i) {
std::cout << arr[i] << " ";
}