backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-05 11:40:46 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
Sorting/OddEven Sort.cpp
View File

@@ -7,23 +7,23 @@ using namespace std;
void oddEven(vector<int> &arr, int size)
{
bool sorted = false;
while( ! sorted )
while (!sorted)
{
sorted = true;
for(int i = 1; i < size-1; i += 2)//Odd
for (int i = 1; i < size - 1; i += 2) //Odd
{
if(arr[i] > arr[i+1])
if (arr[i] > arr[i + 1])
{
swap(arr[i], arr[i+1]);
swap(arr[i], arr[i + 1]);
sorted = false;
}
}
for(int i = 0; i < size-1; i += 2)//Even
for (int i = 0; i < size - 1; i += 2) //Even
{
if(arr[i] > arr[i+1])
if (arr[i] > arr[i + 1])
{
swap(arr[i], arr[i+1]);
swap(arr[i], arr[i + 1]);
sorted = false;
}
}
@@ -37,7 +37,6 @@ void show(vector<int> A, int size)
cout << A[i] << "\n";
}
int main()
{
int size, temp;
@@ -46,7 +45,7 @@ int main()
vector<int> arr;
cout<<"\nEnter the unsorted elements : \n";
cout << "\nEnter the unsorted elements : \n";
for (int i = 0; i < size; ++i)
{
@@ -56,7 +55,7 @@ int main()
oddEven(arr, size);
cout<<"Sorted array\n";
cout << "Sorted array\n";
show(arr, size);
return 0;
}