From facd742c19ae93528e7f991ff27991051088fad7 Mon Sep 17 00:00:00 2001
From: PARISOT paul andrea <parisotp@informatique.univ-paris-diderot.fr>
Date: Mon, 16 Apr 2018 17:13:01 +0200
Subject: [PATCH 1/5]  Implementation of the OddEven sorting algorithm

---
 Sorting/OddEven Sort.cpp | 68 ++++++++++++++++++++++++++++++++++++++++
 Sorting/OddEven_Sort.cpp | 68 ++++++++++++++++++++++++++++++++++++++++
 2 files changed, 136 insertions(+)
 create mode 100644 Sorting/OddEven Sort.cpp
 create mode 100644 Sorting/OddEven_Sort.cpp

diff --git a/Sorting/OddEven Sort.cpp b/Sorting/OddEven Sort.cpp
new file mode 100644
index 000000000..790d391a5
--- /dev/null
+++ b/Sorting/OddEven Sort.cpp	
@@ -0,0 +1,68 @@
+/* C++ implementation Odd Even Sort */
+#include<iostream>
+using namespace std;
+
+void switchElmts(int arr[], int i, int j)
+{
+	int tmp = arr[i];
+	arr[i] = arr[j];
+	arr[j] = tmp;
+}
+
+void oddEven(int arr[], int size)
+{
+	bool sorted = false;
+	while(!sorted)
+	{
+		sorted = true;
+		for(int i = 1; i < size-1; i += 2)//Odd
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+
+		for(int i = 0; i < size-1; i += 2)//Even
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+	}
+}
+
+void show(int A[], int size)
+{
+	int i;
+	for (i = 0; i < size; i++)
+	cout<<A[i]<<"\n";
+}
+
+
+int main()
+{
+	int size;
+	cout<<"\nEnter the number of elements : ";
+
+	cin>>size;
+
+	int arr[size];
+
+	cout<<"\nEnter the unsorted elements : ";
+
+	for (int i = 0; i < size; ++i)
+	{
+		cout<<"\n";
+		cin>>arr[i];
+	}
+
+	oddEven(arr, size);
+
+	cout<<"Sorted array\n";
+	show(arr, size);
+	return 0;
+}
diff --git a/Sorting/OddEven_Sort.cpp b/Sorting/OddEven_Sort.cpp
new file mode 100644
index 000000000..790d391a5
--- /dev/null
+++ b/Sorting/OddEven_Sort.cpp
@@ -0,0 +1,68 @@
+/* C++ implementation Odd Even Sort */
+#include<iostream>
+using namespace std;
+
+void switchElmts(int arr[], int i, int j)
+{
+	int tmp = arr[i];
+	arr[i] = arr[j];
+	arr[j] = tmp;
+}
+
+void oddEven(int arr[], int size)
+{
+	bool sorted = false;
+	while(!sorted)
+	{
+		sorted = true;
+		for(int i = 1; i < size-1; i += 2)//Odd
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+
+		for(int i = 0; i < size-1; i += 2)//Even
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+	}
+}
+
+void show(int A[], int size)
+{
+	int i;
+	for (i = 0; i < size; i++)
+	cout<<A[i]<<"\n";
+}
+
+
+int main()
+{
+	int size;
+	cout<<"\nEnter the number of elements : ";
+
+	cin>>size;
+
+	int arr[size];
+
+	cout<<"\nEnter the unsorted elements : ";
+
+	for (int i = 0; i < size; ++i)
+	{
+		cout<<"\n";
+		cin>>arr[i];
+	}
+
+	oddEven(arr, size);
+
+	cout<<"Sorted array\n";
+	show(arr, size);
+	return 0;
+}

From ceee15943e4cb892c2a144e1abb0346eee09d84a Mon Sep 17 00:00:00 2001
From: PARISOT paul andrea <parisotp@informatique.univ-paris-diderot.fr>
Date: Mon, 16 Apr 2018 17:14:45 +0200
Subject: [PATCH 2/5]  Implementation of the OddEven sorting algorithm

---
 Sorting/OddEven_Sort.cpp | 68 ----------------------------------------
 1 file changed, 68 deletions(-)
 delete mode 100644 Sorting/OddEven_Sort.cpp

diff --git a/Sorting/OddEven_Sort.cpp b/Sorting/OddEven_Sort.cpp
deleted file mode 100644
index 790d391a5..000000000
--- a/Sorting/OddEven_Sort.cpp
+++ /dev/null
@@ -1,68 +0,0 @@
-/* C++ implementation Odd Even Sort */
-#include<iostream>
-using namespace std;
-
-void switchElmts(int arr[], int i, int j)
-{
-	int tmp = arr[i];
-	arr[i] = arr[j];
-	arr[j] = tmp;
-}
-
-void oddEven(int arr[], int size)
-{
-	bool sorted = false;
-	while(!sorted)
-	{
-		sorted = true;
-		for(int i = 1; i < size-1; i += 2)//Odd
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-
-		for(int i = 0; i < size-1; i += 2)//Even
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-	}
-}
-
-void show(int A[], int size)
-{
-	int i;
-	for (i = 0; i < size; i++)
-	cout<<A[i]<<"\n";
-}
-
-
-int main()
-{
-	int size;
-	cout<<"\nEnter the number of elements : ";
-
-	cin>>size;
-
-	int arr[size];
-
-	cout<<"\nEnter the unsorted elements : ";
-
-	for (int i = 0; i < size; ++i)
-	{
-		cout<<"\n";
-		cin>>arr[i];
-	}
-
-	oddEven(arr, size);
-
-	cout<<"Sorted array\n";
-	show(arr, size);
-	return 0;
-}

From ef377b08078e3f12f3c21809e58d8ff490965214 Mon Sep 17 00:00:00 2001
From: PARISOT paul andrea <parisotp@informatique.univ-paris-diderot.fr>
Date: Fri, 27 Apr 2018 15:48:55 +0200
Subject: [PATCH 3/5]  implementation of the odd even sort

---
 Sorting/OddEven_Sort.cpp | 68 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 68 insertions(+)
 create mode 100644 Sorting/OddEven_Sort.cpp

diff --git a/Sorting/OddEven_Sort.cpp b/Sorting/OddEven_Sort.cpp
new file mode 100644
index 000000000..790d391a5
--- /dev/null
+++ b/Sorting/OddEven_Sort.cpp
@@ -0,0 +1,68 @@
+/* C++ implementation Odd Even Sort */
+#include<iostream>
+using namespace std;
+
+void switchElmts(int arr[], int i, int j)
+{
+	int tmp = arr[i];
+	arr[i] = arr[j];
+	arr[j] = tmp;
+}
+
+void oddEven(int arr[], int size)
+{
+	bool sorted = false;
+	while(!sorted)
+	{
+		sorted = true;
+		for(int i = 1; i < size-1; i += 2)//Odd
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+
+		for(int i = 0; i < size-1; i += 2)//Even
+		{
+			if(arr[i] > arr[i+1])
+			{
+				switchElmts(arr,i,i+1);
+				sorted = false;
+			}
+		}
+	}
+}
+
+void show(int A[], int size)
+{
+	int i;
+	for (i = 0; i < size; i++)
+	cout<<A[i]<<"\n";
+}
+
+
+int main()
+{
+	int size;
+	cout<<"\nEnter the number of elements : ";
+
+	cin>>size;
+
+	int arr[size];
+
+	cout<<"\nEnter the unsorted elements : ";
+
+	for (int i = 0; i < size; ++i)
+	{
+		cout<<"\n";
+		cin>>arr[i];
+	}
+
+	oddEven(arr, size);
+
+	cout<<"Sorted array\n";
+	show(arr, size);
+	return 0;
+}

From a73dc04f0ac04ac76ed2223f0c8d3af842437ace Mon Sep 17 00:00:00 2001
From: Ashwek Swamy <39827514+ashwek@users.noreply.github.com>
Date: Sun, 10 Feb 2019 11:20:09 +0530
Subject: [PATCH 4/5] Update OddEven Sort.cpp

---
 Sorting/OddEven Sort.cpp | 38 ++++++++++++++++----------------------
 1 file changed, 16 insertions(+), 22 deletions(-)

diff --git a/Sorting/OddEven Sort.cpp b/Sorting/OddEven Sort.cpp
index 790d391a5..6319cca91 100644
--- a/Sorting/OddEven Sort.cpp	
+++ b/Sorting/OddEven Sort.cpp	
@@ -1,25 +1,20 @@
 /* C++ implementation Odd Even Sort */
-#include<iostream>
+#include <iostream>
+#include <vector>
+
 using namespace std;
 
-void switchElmts(int arr[], int i, int j)
-{
-	int tmp = arr[i];
-	arr[i] = arr[j];
-	arr[j] = tmp;
-}
-
-void oddEven(int arr[], int size)
+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
 		{
 			if(arr[i] > arr[i+1])
 			{
-				switchElmts(arr,i,i+1);
+				swap(arr[i], arr[i+1]);
 				sorted = false;
 			}
 		}
@@ -28,36 +23,35 @@ void oddEven(int arr[], int size)
 		{
 			if(arr[i] > arr[i+1])
 			{
-				switchElmts(arr,i,i+1);
+				swap(arr[i], arr[i+1]);
 				sorted = false;
 			}
 		}
 	}
 }
 
-void show(int A[], int size)
+void show(vector<int> A, int size)
 {
 	int i;
 	for (i = 0; i < size; i++)
-	cout<<A[i]<<"\n";
+		cout << A[i] << "\n";
 }
 
 
 int main()
 {
-	int size;
-	cout<<"\nEnter the number of elements : ";
+	int size, temp;
+	cout << "\nEnter the number of elements : ";
+	cin >> size;
 
-	cin>>size;
+	vector<int> arr;
 
-	int arr[size];
-
-	cout<<"\nEnter the unsorted elements : ";
+	cout<<"\nEnter the unsorted elements : \n";
 
 	for (int i = 0; i < size; ++i)
 	{
-		cout<<"\n";
-		cin>>arr[i];
+		cin >> temp;
+		arr.push_back(temp);
 	}
 
 	oddEven(arr, size);

From cd6a6b6d2864646dbaceb2c9ca49648585c30adc Mon Sep 17 00:00:00 2001
From: Ashwek Swamy <39827514+ashwek@users.noreply.github.com>
Date: Sun, 10 Feb 2019 11:21:31 +0530
Subject: [PATCH 5/5] Delete duplicate file

---
 Sorting/OddEven_Sort.cpp | 68 ----------------------------------------
 1 file changed, 68 deletions(-)
 delete mode 100644 Sorting/OddEven_Sort.cpp

diff --git a/Sorting/OddEven_Sort.cpp b/Sorting/OddEven_Sort.cpp
deleted file mode 100644
index 790d391a5..000000000
--- a/Sorting/OddEven_Sort.cpp
+++ /dev/null
@@ -1,68 +0,0 @@
-/* C++ implementation Odd Even Sort */
-#include<iostream>
-using namespace std;
-
-void switchElmts(int arr[], int i, int j)
-{
-	int tmp = arr[i];
-	arr[i] = arr[j];
-	arr[j] = tmp;
-}
-
-void oddEven(int arr[], int size)
-{
-	bool sorted = false;
-	while(!sorted)
-	{
-		sorted = true;
-		for(int i = 1; i < size-1; i += 2)//Odd
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-
-		for(int i = 0; i < size-1; i += 2)//Even
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-	}
-}
-
-void show(int A[], int size)
-{
-	int i;
-	for (i = 0; i < size; i++)
-	cout<<A[i]<<"\n";
-}
-
-
-int main()
-{
-	int size;
-	cout<<"\nEnter the number of elements : ";
-
-	cin>>size;
-
-	int arr[size];
-
-	cout<<"\nEnter the unsorted elements : ";
-
-	for (int i = 0; i < size; ++i)
-	{
-		cout<<"\n";
-		cin>>arr[i];
-	}
-
-	oddEven(arr, size);
-
-	cout<<"Sorted array\n";
-	show(arr, size);
-	return 0;
-}